/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_25x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:31:13,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:31:13,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:31:13,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:31:13,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:31:13,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:31:13,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:31:13,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:31:13,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:31:13,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:31:13,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:31:13,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:31:13,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:31:13,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:31:13,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:31:13,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:31:13,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:31:13,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:31:13,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:31:13,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:31:13,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:31:13,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:31:13,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:31:13,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:31:13,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:31:13,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:31:13,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:31:13,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:31:13,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:31:13,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:31:13,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:31:13,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:31:13,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:31:13,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:31:13,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:31:13,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:31:13,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:31:13,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:31:13,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:31:13,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:31:13,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:31:13,580 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:31:13,591 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:31:13,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:31:13,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:31:13,593 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:31:13,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:31:13,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:31:13,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:31:13,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:31:13,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:31:13,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:31:13,595 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:31:13,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:31:13,595 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:31:13,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:31:13,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:31:13,596 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:31:13,596 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:31:13,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:31:13,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:31:13,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:31:13,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:31:13,597 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:31:13,597 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:31:14,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:31:14,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:31:14,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:31:14,072 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:31:14,073 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:31:14,074 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_25x0-1.c [2020-09-04 16:31:14,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b9fba0104/6651e74fd9eb49579e749f7aa72562b5/FLAGd968d4849 [2020-09-04 16:31:14,693 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:31:14,694 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/sum_25x0-1.c [2020-09-04 16:31:14,703 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b9fba0104/6651e74fd9eb49579e749f7aa72562b5/FLAGd968d4849 [2020-09-04 16:31:15,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b9fba0104/6651e74fd9eb49579e749f7aa72562b5 [2020-09-04 16:31:15,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:31:15,042 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:31:15,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:31:15,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:31:15,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:31:15,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:31:15" (1/1) ... [2020-09-04 16:31:15,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2641392f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:15, skipping insertion in model container [2020-09-04 16:31:15,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:31:15" (1/1) ... [2020-09-04 16:31:15,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:31:15,087 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:31:15,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:31:15,318 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:31:15,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:31:15,352 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:31:15,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:15 WrapperNode [2020-09-04 16:31:15,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:31:15,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:31:15,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:31:15,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:31:15,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:15" (1/1) ... [2020-09-04 16:31:15,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:15" (1/1) ... [2020-09-04 16:31:15,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:15" (1/1) ... [2020-09-04 16:31:15,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:15" (1/1) ... [2020-09-04 16:31:15,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:15" (1/1) ... [2020-09-04 16:31:15,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:15" (1/1) ... [2020-09-04 16:31:15,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:15" (1/1) ... [2020-09-04 16:31:15,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:31:15,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:31:15,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:31:15,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:31:15,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:15" (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:31:15,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:31:15,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:31:15,555 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-09-04 16:31:15,555 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:31:15,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:31:15,555 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-09-04 16:31:15,555 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:31:15,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:31:15,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:31:15,757 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:31:15,758 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:31:15,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:31:15 BoogieIcfgContainer [2020-09-04 16:31:15,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:31:15,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:31:15,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:31:15,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:31:15,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:31:15" (1/3) ... [2020-09-04 16:31:15,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d166b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:31:15, skipping insertion in model container [2020-09-04 16:31:15,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:15" (2/3) ... [2020-09-04 16:31:15,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d166b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:31:15, skipping insertion in model container [2020-09-04 16:31:15,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:31:15" (3/3) ... [2020-09-04 16:31:15,806 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_25x0-1.c [2020-09-04 16:31:15,820 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:31:15,845 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:31:15,879 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:31:15,905 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:31:15,905 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:31:15,905 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:31:15,905 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:31:15,906 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:31:15,906 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:31:15,906 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:31:15,906 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:31:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-09-04 16:31:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-04 16:31:15,937 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:15,938 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:31:15,939 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:15,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:15,945 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-09-04 16:31:15,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:15,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [343026347] [2020-09-04 16:31:15,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:16,022 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,237 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:31:16,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [343026347] [2020-09-04 16:31:16,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:16,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:31:16,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726544046] [2020-09-04 16:31:16,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:31:16,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:16,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:31:16,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:31:16,267 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-09-04 16:31:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:16,377 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-09-04 16:31:16,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:31:16,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-09-04 16:31:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:16,392 INFO L225 Difference]: With dead ends: 39 [2020-09-04 16:31:16,393 INFO L226 Difference]: Without dead ends: 25 [2020-09-04 16:31:16,397 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:31:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-09-04 16:31:16,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-09-04 16:31:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-09-04 16:31:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-09-04 16:31:16,454 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-09-04 16:31:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:16,455 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-09-04 16:31:16,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:31:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-09-04 16:31:16,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 16:31:16,458 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:16,458 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:31:16,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:31:16,459 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:16,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:16,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-09-04 16:31:16,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:16,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [587022776] [2020-09-04 16:31:16,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:16,463 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,617 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:31:16,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [587022776] [2020-09-04 16:31:16,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:16,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:31:16,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922625906] [2020-09-04 16:31:16,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:31:16,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:16,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:31:16,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:31:16,621 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2020-09-04 16:31:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:16,713 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-09-04 16:31:16,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:31:16,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-09-04 16:31:16,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:16,716 INFO L225 Difference]: With dead ends: 36 [2020-09-04 16:31:16,716 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 16:31:16,718 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:31:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 16:31:16,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 16:31:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 16:31:16,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-09-04 16:31:16,731 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2020-09-04 16:31:16,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:16,731 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-09-04 16:31:16,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:31:16,732 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-09-04 16:31:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 16:31:16,733 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:16,734 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:31:16,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:31:16,734 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:16,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:16,735 INFO L82 PathProgramCache]: Analyzing trace with hash -175020829, now seen corresponding path program 2 times [2020-09-04 16:31:16,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:16,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [618442787] [2020-09-04 16:31:16,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:16,738 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,934 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:31:16,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [618442787] [2020-09-04 16:31:16,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:16,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:31:16,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332522025] [2020-09-04 16:31:16,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:31:16,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:16,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:31:16,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:31:16,937 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2020-09-04 16:31:17,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:17,021 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-09-04 16:31:17,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:31:17,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-09-04 16:31:17,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:17,024 INFO L225 Difference]: With dead ends: 41 [2020-09-04 16:31:17,024 INFO L226 Difference]: Without dead ends: 35 [2020-09-04 16:31:17,025 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:31:17,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-09-04 16:31:17,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-09-04 16:31:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-09-04 16:31:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-09-04 16:31:17,038 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 36 [2020-09-04 16:31:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:17,038 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-09-04 16:31:17,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:31:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-09-04 16:31:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-09-04 16:31:17,040 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:17,041 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:31:17,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:31:17,041 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:17,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:17,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1021564803, now seen corresponding path program 3 times [2020-09-04 16:31:17,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:17,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [372722357] [2020-09-04 16:31:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:17,045 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,297 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:31:17,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [372722357] [2020-09-04 16:31:17,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:17,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:31:17,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600747888] [2020-09-04 16:31:17,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:31:17,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:17,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:31:17,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:31:17,301 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 8 states. [2020-09-04 16:31:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:17,397 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-09-04 16:31:17,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:31:17,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-09-04 16:31:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:17,400 INFO L225 Difference]: With dead ends: 46 [2020-09-04 16:31:17,401 INFO L226 Difference]: Without dead ends: 40 [2020-09-04 16:31:17,405 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:31:17,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-09-04 16:31:17,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-09-04 16:31:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-09-04 16:31:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-09-04 16:31:17,428 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 45 [2020-09-04 16:31:17,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:17,429 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-09-04 16:31:17,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:31:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-09-04 16:31:17,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 16:31:17,433 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:17,433 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:31:17,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:31:17,434 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:17,434 INFO L82 PathProgramCache]: Analyzing trace with hash -263249715, now seen corresponding path program 4 times [2020-09-04 16:31:17,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:17,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1887928643] [2020-09-04 16:31:17,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:17,438 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,689 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:31:17,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1887928643] [2020-09-04 16:31:17,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:17,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:31:17,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80848982] [2020-09-04 16:31:17,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:31:17,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:17,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:31:17,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:31:17,692 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2020-09-04 16:31:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:17,824 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-09-04 16:31:17,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:31:17,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-09-04 16:31:17,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:17,826 INFO L225 Difference]: With dead ends: 51 [2020-09-04 16:31:17,826 INFO L226 Difference]: Without dead ends: 45 [2020-09-04 16:31:17,830 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:31:17,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-04 16:31:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-09-04 16:31:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-04 16:31:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-09-04 16:31:17,855 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 54 [2020-09-04 16:31:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:17,855 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-09-04 16:31:17,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:31:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-09-04 16:31:17,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 16:31:17,858 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:17,861 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:31:17,861 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:31:17,862 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:17,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:17,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1884999187, now seen corresponding path program 5 times [2020-09-04 16:31:17,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:17,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1929645131] [2020-09-04 16:31:17,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:17,865 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,122 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:31:18,123 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1929645131] [2020-09-04 16:31:18,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:18,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:31:18,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140661129] [2020-09-04 16:31:18,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:31:18,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:18,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:31:18,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:31:18,126 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 10 states. [2020-09-04 16:31:18,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:18,240 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-09-04 16:31:18,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:31:18,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-09-04 16:31:18,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:18,243 INFO L225 Difference]: With dead ends: 56 [2020-09-04 16:31:18,243 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 16:31:18,244 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:31:18,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 16:31:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 16:31:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 16:31:18,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-09-04 16:31:18,255 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 63 [2020-09-04 16:31:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:18,256 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-09-04 16:31:18,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:31:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-09-04 16:31:18,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 16:31:18,258 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:18,258 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:31:18,258 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:31:18,258 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:18,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:18,259 INFO L82 PathProgramCache]: Analyzing trace with hash -441437769, now seen corresponding path program 6 times [2020-09-04 16:31:18,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:18,260 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2095908533] [2020-09-04 16:31:18,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:18,262 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,547 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:31:18,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2095908533] [2020-09-04 16:31:18,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:18,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:31:18,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50019699] [2020-09-04 16:31:18,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:31:18,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:18,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:31:18,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:31:18,550 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 11 states. [2020-09-04 16:31:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:18,683 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-09-04 16:31:18,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:31:18,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-09-04 16:31:18,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:18,686 INFO L225 Difference]: With dead ends: 61 [2020-09-04 16:31:18,686 INFO L226 Difference]: Without dead ends: 55 [2020-09-04 16:31:18,687 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:31:18,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-09-04 16:31:18,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-09-04 16:31:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 16:31:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-09-04 16:31:18,698 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 72 [2020-09-04 16:31:18,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:18,698 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-09-04 16:31:18,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:31:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-09-04 16:31:18,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-09-04 16:31:18,700 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:18,700 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:31:18,701 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:31:18,701 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:18,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:18,701 INFO L82 PathProgramCache]: Analyzing trace with hash 999943849, now seen corresponding path program 7 times [2020-09-04 16:31:18,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:18,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2116719351] [2020-09-04 16:31:18,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:18,704 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,023 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:31:19,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2116719351] [2020-09-04 16:31:19,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:19,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:31:19,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960525140] [2020-09-04 16:31:19,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:31:19,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:19,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:31:19,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:31:19,027 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 12 states. [2020-09-04 16:31:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:19,158 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-09-04 16:31:19,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:31:19,159 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-09-04 16:31:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:19,161 INFO L225 Difference]: With dead ends: 66 [2020-09-04 16:31:19,161 INFO L226 Difference]: Without dead ends: 60 [2020-09-04 16:31:19,162 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:31:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-04 16:31:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-09-04 16:31:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-09-04 16:31:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-09-04 16:31:19,173 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 81 [2020-09-04 16:31:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:19,173 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-09-04 16:31:19,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:31:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-09-04 16:31:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-09-04 16:31:19,175 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:19,175 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:31:19,175 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:31:19,176 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:19,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:19,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1356134305, now seen corresponding path program 8 times [2020-09-04 16:31:19,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:19,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1346804680] [2020-09-04 16:31:19,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:19,178 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,613 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:31:19,613 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1346804680] [2020-09-04 16:31:19,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:19,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:31:19,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463538420] [2020-09-04 16:31:19,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:31:19,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:19,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:31:19,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:31:19,625 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 13 states. [2020-09-04 16:31:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:19,807 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-09-04 16:31:19,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:31:19,807 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-09-04 16:31:19,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:19,810 INFO L225 Difference]: With dead ends: 71 [2020-09-04 16:31:19,810 INFO L226 Difference]: Without dead ends: 65 [2020-09-04 16:31:19,811 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:31:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-09-04 16:31:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-09-04 16:31:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-09-04 16:31:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-09-04 16:31:19,834 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 90 [2020-09-04 16:31:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:19,834 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-09-04 16:31:19,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:31:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-09-04 16:31:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-09-04 16:31:19,838 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:19,838 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:31:19,839 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:31:19,839 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:19,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:19,839 INFO L82 PathProgramCache]: Analyzing trace with hash -928437697, now seen corresponding path program 9 times [2020-09-04 16:31:19,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:19,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [910256155] [2020-09-04 16:31:19,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:19,844 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,339 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:31:20,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [910256155] [2020-09-04 16:31:20,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:20,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:31:20,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101455173] [2020-09-04 16:31:20,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:31:20,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:20,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:31:20,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:31:20,345 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2020-09-04 16:31:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:20,511 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-09-04 16:31:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:31:20,512 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-09-04 16:31:20,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:20,513 INFO L225 Difference]: With dead ends: 76 [2020-09-04 16:31:20,513 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 16:31:20,516 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:31:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 16:31:20,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 16:31:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 16:31:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-09-04 16:31:20,531 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 99 [2020-09-04 16:31:20,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:20,532 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-09-04 16:31:20,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:31:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-09-04 16:31:20,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 16:31:20,534 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:20,534 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:31:20,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:31:20,535 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:20,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:20,535 INFO L82 PathProgramCache]: Analyzing trace with hash -276966773, now seen corresponding path program 10 times [2020-09-04 16:31:20,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:20,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [956175591] [2020-09-04 16:31:20,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:20,541 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-09-04 16:31:21,019 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [956175591] [2020-09-04 16:31:21,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:21,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:31:21,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597710086] [2020-09-04 16:31:21,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:31:21,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:21,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:31:21,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:31:21,021 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 15 states. [2020-09-04 16:31:21,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:21,208 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-09-04 16:31:21,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 16:31:21,209 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-09-04 16:31:21,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:21,211 INFO L225 Difference]: With dead ends: 81 [2020-09-04 16:31:21,211 INFO L226 Difference]: Without dead ends: 75 [2020-09-04 16:31:21,212 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-09-04 16:31:21,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-04 16:31:21,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-09-04 16:31:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-09-04 16:31:21,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-09-04 16:31:21,223 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 108 [2020-09-04 16:31:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:21,224 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-09-04 16:31:21,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:31:21,224 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-09-04 16:31:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-09-04 16:31:21,226 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:21,226 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:21,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:31:21,227 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:21,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:21,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1749540651, now seen corresponding path program 11 times [2020-09-04 16:31:21,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:21,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [466701226] [2020-09-04 16:31:21,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:21,230 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-09-04 16:31:21,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [466701226] [2020-09-04 16:31:21,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:21,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:31:21,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869887006] [2020-09-04 16:31:21,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:31:21,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:21,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:31:21,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:31:21,817 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 16 states. [2020-09-04 16:31:22,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:22,031 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-09-04 16:31:22,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:31:22,032 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-09-04 16:31:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:22,033 INFO L225 Difference]: With dead ends: 86 [2020-09-04 16:31:22,034 INFO L226 Difference]: Without dead ends: 80 [2020-09-04 16:31:22,035 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:31:22,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-09-04 16:31:22,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-09-04 16:31:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-09-04 16:31:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2020-09-04 16:31:22,047 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 117 [2020-09-04 16:31:22,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:22,048 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2020-09-04 16:31:22,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:31:22,049 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2020-09-04 16:31:22,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-09-04 16:31:22,050 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:22,051 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:22,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:31:22,051 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:22,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:22,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1141580405, now seen corresponding path program 12 times [2020-09-04 16:31:22,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:22,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1255720985] [2020-09-04 16:31:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:22,055 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-09-04 16:31:22,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1255720985] [2020-09-04 16:31:22,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:22,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:31:22,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269422187] [2020-09-04 16:31:22,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:31:22,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:22,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:31:22,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:31:22,752 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 17 states. [2020-09-04 16:31:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:22,979 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-09-04 16:31:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 16:31:22,979 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-09-04 16:31:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:22,981 INFO L225 Difference]: With dead ends: 91 [2020-09-04 16:31:22,981 INFO L226 Difference]: Without dead ends: 85 [2020-09-04 16:31:22,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-09-04 16:31:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-09-04 16:31:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-09-04 16:31:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-09-04 16:31:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2020-09-04 16:31:22,993 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 126 [2020-09-04 16:31:22,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:22,993 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2020-09-04 16:31:22,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:31:22,993 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2020-09-04 16:31:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-04 16:31:22,995 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:22,995 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:22,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:31:22,996 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:22,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:22,996 INFO L82 PathProgramCache]: Analyzing trace with hash 55997035, now seen corresponding path program 13 times [2020-09-04 16:31:22,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:22,997 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1955291998] [2020-09-04 16:31:22,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:22,998 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,770 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-09-04 16:31:23,771 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1955291998] [2020-09-04 16:31:23,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:23,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 16:31:23,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339798196] [2020-09-04 16:31:23,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 16:31:23,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:23,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 16:31:23,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:31:23,773 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 18 states. [2020-09-04 16:31:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:23,984 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-09-04 16:31:23,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:31:23,985 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-09-04 16:31:23,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:23,986 INFO L225 Difference]: With dead ends: 96 [2020-09-04 16:31:23,986 INFO L226 Difference]: Without dead ends: 90 [2020-09-04 16:31:23,987 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2020-09-04 16:31:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-09-04 16:31:23,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-09-04 16:31:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-09-04 16:31:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2020-09-04 16:31:23,996 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 135 [2020-09-04 16:31:23,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:23,997 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2020-09-04 16:31:23,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 16:31:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2020-09-04 16:31:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-09-04 16:31:23,999 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:23,999 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:23,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 16:31:24,000 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:24,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:24,000 INFO L82 PathProgramCache]: Analyzing trace with hash 394086239, now seen corresponding path program 14 times [2020-09-04 16:31:24,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:24,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1627296003] [2020-09-04 16:31:24,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:24,002 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-09-04 16:31:24,761 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1627296003] [2020-09-04 16:31:24,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:24,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 16:31:24,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121834556] [2020-09-04 16:31:24,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 16:31:24,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:24,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 16:31:24,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:31:24,763 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 19 states. [2020-09-04 16:31:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:25,046 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-09-04 16:31:25,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:31:25,047 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-09-04 16:31:25,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:25,049 INFO L225 Difference]: With dead ends: 101 [2020-09-04 16:31:25,049 INFO L226 Difference]: Without dead ends: 95 [2020-09-04 16:31:25,052 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 16:31:25,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-09-04 16:31:25,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-09-04 16:31:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 16:31:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2020-09-04 16:31:25,062 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 144 [2020-09-04 16:31:25,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:25,064 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2020-09-04 16:31:25,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 16:31:25,065 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2020-09-04 16:31:25,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-04 16:31:25,067 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:25,067 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:25,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 16:31:25,067 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:25,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:25,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1047772929, now seen corresponding path program 15 times [2020-09-04 16:31:25,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:25,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [602929601] [2020-09-04 16:31:25,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:25,070 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-09-04 16:31:25,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [602929601] [2020-09-04 16:31:25,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:25,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-09-04 16:31:25,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483824637] [2020-09-04 16:31:25,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 16:31:25,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:25,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 16:31:25,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:31:25,985 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 20 states. [2020-09-04 16:31:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:26,244 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-09-04 16:31:26,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 16:31:26,245 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-09-04 16:31:26,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:26,246 INFO L225 Difference]: With dead ends: 106 [2020-09-04 16:31:26,247 INFO L226 Difference]: Without dead ends: 100 [2020-09-04 16:31:26,248 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2020-09-04 16:31:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-09-04 16:31:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2020-09-04 16:31:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-09-04 16:31:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2020-09-04 16:31:26,256 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 153 [2020-09-04 16:31:26,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:26,257 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2020-09-04 16:31:26,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 16:31:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2020-09-04 16:31:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-09-04 16:31:26,259 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:26,259 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:26,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 16:31:26,260 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:26,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:26,260 INFO L82 PathProgramCache]: Analyzing trace with hash -76242615, now seen corresponding path program 16 times [2020-09-04 16:31:26,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:26,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1370713482] [2020-09-04 16:31:26,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:26,262 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-09-04 16:31:27,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1370713482] [2020-09-04 16:31:27,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:27,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-09-04 16:31:27,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232431318] [2020-09-04 16:31:27,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 16:31:27,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:27,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 16:31:27,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:31:27,508 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 21 states. [2020-09-04 16:31:27,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:27,838 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-09-04 16:31:27,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 16:31:27,839 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2020-09-04 16:31:27,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:27,841 INFO L225 Difference]: With dead ends: 111 [2020-09-04 16:31:27,842 INFO L226 Difference]: Without dead ends: 105 [2020-09-04 16:31:27,844 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2020-09-04 16:31:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-09-04 16:31:27,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-09-04 16:31:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-04 16:31:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2020-09-04 16:31:27,856 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 162 [2020-09-04 16:31:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:27,857 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2020-09-04 16:31:27,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 16:31:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2020-09-04 16:31:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-09-04 16:31:27,859 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:27,859 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:27,859 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 16:31:27,860 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:27,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:27,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1382000279, now seen corresponding path program 17 times [2020-09-04 16:31:27,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:27,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [303594015] [2020-09-04 16:31:27,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:27,864 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-09-04 16:31:29,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [303594015] [2020-09-04 16:31:29,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:29,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-09-04 16:31:29,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584434650] [2020-09-04 16:31:29,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 16:31:29,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:29,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 16:31:29,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:31:29,230 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 22 states. [2020-09-04 16:31:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:29,628 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2020-09-04 16:31:29,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 16:31:29,629 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 171 [2020-09-04 16:31:29,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:29,631 INFO L225 Difference]: With dead ends: 116 [2020-09-04 16:31:29,631 INFO L226 Difference]: Without dead ends: 110 [2020-09-04 16:31:29,633 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-09-04 16:31:29,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-09-04 16:31:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-09-04 16:31:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-09-04 16:31:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2020-09-04 16:31:29,647 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 171 [2020-09-04 16:31:29,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:29,648 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2020-09-04 16:31:29,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 16:31:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2020-09-04 16:31:29,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-09-04 16:31:29,652 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:29,652 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:29,652 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 16:31:29,652 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:29,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:29,653 INFO L82 PathProgramCache]: Analyzing trace with hash -869167053, now seen corresponding path program 18 times [2020-09-04 16:31:29,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:29,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2006135035] [2020-09-04 16:31:29,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:29,658 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-09-04 16:31:31,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2006135035] [2020-09-04 16:31:31,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:31,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-09-04 16:31:31,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98673900] [2020-09-04 16:31:31,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 16:31:31,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:31,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 16:31:31,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-09-04 16:31:31,012 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 23 states. [2020-09-04 16:31:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:31,322 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2020-09-04 16:31:31,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 16:31:31,322 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2020-09-04 16:31:31,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:31,324 INFO L225 Difference]: With dead ends: 121 [2020-09-04 16:31:31,324 INFO L226 Difference]: Without dead ends: 115 [2020-09-04 16:31:31,325 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 16:31:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-09-04 16:31:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2020-09-04 16:31:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-09-04 16:31:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2020-09-04 16:31:31,334 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 180 [2020-09-04 16:31:31,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:31,335 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2020-09-04 16:31:31,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 16:31:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2020-09-04 16:31:31,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-09-04 16:31:31,337 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:31,337 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:31,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 16:31:31,338 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:31,338 INFO L82 PathProgramCache]: Analyzing trace with hash 482986285, now seen corresponding path program 19 times [2020-09-04 16:31:31,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:31,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [26679533] [2020-09-04 16:31:31,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:31,341 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-09-04 16:31:32,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [26679533] [2020-09-04 16:31:32,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:32,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-09-04 16:31:32,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788469474] [2020-09-04 16:31:32,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 16:31:32,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:32,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 16:31:32,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:31:32,816 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 24 states. [2020-09-04 16:31:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:33,140 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2020-09-04 16:31:33,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 16:31:33,141 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2020-09-04 16:31:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:33,142 INFO L225 Difference]: With dead ends: 126 [2020-09-04 16:31:33,143 INFO L226 Difference]: Without dead ends: 120 [2020-09-04 16:31:33,145 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2020-09-04 16:31:33,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-09-04 16:31:33,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-09-04 16:31:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-09-04 16:31:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2020-09-04 16:31:33,161 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 189 [2020-09-04 16:31:33,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:33,161 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2020-09-04 16:31:33,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 16:31:33,162 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2020-09-04 16:31:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-09-04 16:31:33,164 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:33,165 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:33,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 16:31:33,165 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:33,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:33,166 INFO L82 PathProgramCache]: Analyzing trace with hash 848589853, now seen corresponding path program 20 times [2020-09-04 16:31:33,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:33,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [857812371] [2020-09-04 16:31:33,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:33,170 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-09-04 16:31:34,655 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [857812371] [2020-09-04 16:31:34,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:34,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-09-04 16:31:34,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397365521] [2020-09-04 16:31:34,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 16:31:34,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:34,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 16:31:34,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2020-09-04 16:31:34,657 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 25 states. [2020-09-04 16:31:35,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:35,031 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2020-09-04 16:31:35,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 16:31:35,031 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 198 [2020-09-04 16:31:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:35,033 INFO L225 Difference]: With dead ends: 131 [2020-09-04 16:31:35,033 INFO L226 Difference]: Without dead ends: 125 [2020-09-04 16:31:35,034 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2020-09-04 16:31:35,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-09-04 16:31:35,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-09-04 16:31:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-09-04 16:31:35,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2020-09-04 16:31:35,044 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 198 [2020-09-04 16:31:35,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:35,045 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2020-09-04 16:31:35,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 16:31:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2020-09-04 16:31:35,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-09-04 16:31:35,048 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:35,048 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:35,048 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 16:31:35,048 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:35,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:35,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1304544963, now seen corresponding path program 21 times [2020-09-04 16:31:35,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:35,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [384672702] [2020-09-04 16:31:35,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:35,051 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-09-04 16:31:36,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [384672702] [2020-09-04 16:31:36,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:36,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-09-04 16:31:36,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964074637] [2020-09-04 16:31:36,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-04 16:31:36,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:36,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-04 16:31:36,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2020-09-04 16:31:36,467 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 26 states. [2020-09-04 16:31:36,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:36,917 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2020-09-04 16:31:36,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 16:31:36,918 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 207 [2020-09-04 16:31:36,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:36,920 INFO L225 Difference]: With dead ends: 136 [2020-09-04 16:31:36,920 INFO L226 Difference]: Without dead ends: 130 [2020-09-04 16:31:36,922 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2020-09-04 16:31:36,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-09-04 16:31:36,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-09-04 16:31:36,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-09-04 16:31:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2020-09-04 16:31:36,932 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 207 [2020-09-04 16:31:36,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:36,932 INFO L479 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2020-09-04 16:31:36,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-04 16:31:36,933 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2020-09-04 16:31:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-09-04 16:31:36,935 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:36,936 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:36,936 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 16:31:36,936 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:36,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:36,937 INFO L82 PathProgramCache]: Analyzing trace with hash 639479047, now seen corresponding path program 22 times [2020-09-04 16:31:36,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:36,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [43778054] [2020-09-04 16:31:36,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:36,939 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2020-09-04 16:31:38,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [43778054] [2020-09-04 16:31:38,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:38,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-09-04 16:31:38,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525323935] [2020-09-04 16:31:38,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 16:31:38,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:38,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 16:31:38,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2020-09-04 16:31:38,485 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 27 states. [2020-09-04 16:31:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:38,948 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2020-09-04 16:31:38,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 16:31:38,950 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 216 [2020-09-04 16:31:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:38,951 INFO L225 Difference]: With dead ends: 141 [2020-09-04 16:31:38,951 INFO L226 Difference]: Without dead ends: 135 [2020-09-04 16:31:38,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2020-09-04 16:31:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-09-04 16:31:38,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-09-04 16:31:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-09-04 16:31:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2020-09-04 16:31:38,965 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 216 [2020-09-04 16:31:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:38,966 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2020-09-04 16:31:38,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 16:31:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2020-09-04 16:31:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-09-04 16:31:38,967 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:38,967 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:38,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 16:31:38,968 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:38,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:38,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1706508121, now seen corresponding path program 23 times [2020-09-04 16:31:38,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:38,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [298665927] [2020-09-04 16:31:38,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:38,971 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2020-09-04 16:31:40,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [298665927] [2020-09-04 16:31:40,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:40,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2020-09-04 16:31:40,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581183261] [2020-09-04 16:31:40,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-09-04 16:31:40,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:40,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-09-04 16:31:40,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:31:40,606 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 28 states. [2020-09-04 16:31:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:41,092 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2020-09-04 16:31:41,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 16:31:41,093 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 225 [2020-09-04 16:31:41,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:41,094 INFO L225 Difference]: With dead ends: 146 [2020-09-04 16:31:41,094 INFO L226 Difference]: Without dead ends: 140 [2020-09-04 16:31:41,096 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2020-09-04 16:31:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-09-04 16:31:41,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2020-09-04 16:31:41,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-09-04 16:31:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2020-09-04 16:31:41,105 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 225 [2020-09-04 16:31:41,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:41,105 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2020-09-04 16:31:41,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-09-04 16:31:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2020-09-04 16:31:41,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-09-04 16:31:41,107 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:41,107 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:41,107 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-04 16:31:41,108 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:41,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:41,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1861065457, now seen corresponding path program 24 times [2020-09-04 16:31:41,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:41,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [448654986] [2020-09-04 16:31:41,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:41,110 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2020-09-04 16:31:42,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [448654986] [2020-09-04 16:31:42,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:42,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2020-09-04 16:31:42,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776092399] [2020-09-04 16:31:42,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-09-04 16:31:42,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:42,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-09-04 16:31:42,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2020-09-04 16:31:42,916 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 29 states. [2020-09-04 16:31:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:43,415 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2020-09-04 16:31:43,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-04 16:31:43,415 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 234 [2020-09-04 16:31:43,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:43,417 INFO L225 Difference]: With dead ends: 151 [2020-09-04 16:31:43,417 INFO L226 Difference]: Without dead ends: 145 [2020-09-04 16:31:43,424 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2020-09-04 16:31:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-09-04 16:31:43,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-09-04 16:31:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-09-04 16:31:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2020-09-04 16:31:43,437 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 234 [2020-09-04 16:31:43,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:43,437 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2020-09-04 16:31:43,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-09-04 16:31:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2020-09-04 16:31:43,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-09-04 16:31:43,440 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:43,441 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:43,441 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-04 16:31:43,441 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:43,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:43,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1283861777, now seen corresponding path program 25 times [2020-09-04 16:31:43,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:43,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1363753066] [2020-09-04 16:31:43,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:43,444 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:43,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:43,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:43,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:45,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:45,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:45,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:45,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:45,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:45,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:45,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:47,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:47,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:47,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2020-09-04 16:31:48,420 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1363753066] [2020-09-04 16:31:48,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:48,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2020-09-04 16:31:48,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541947368] [2020-09-04 16:31:48,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2020-09-04 16:31:48,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:48,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2020-09-04 16:31:48,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=2818, Unknown=0, NotChecked=0, Total=3540 [2020-09-04 16:31:48,424 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 60 states. [2020-09-04 16:31:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:55,591 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2020-09-04 16:31:55,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2020-09-04 16:31:55,591 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 243 [2020-09-04 16:31:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:55,592 INFO L225 Difference]: With dead ends: 145 [2020-09-04 16:31:55,593 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:31:55,600 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2637 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=3968, Invalid=15214, Unknown=0, NotChecked=0, Total=19182 [2020-09-04 16:31:55,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:31:55,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:31:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:31:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:31:55,601 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 243 [2020-09-04 16:31:55,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:55,601 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:31:55,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 60 states. [2020-09-04 16:31:55,602 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:31:55,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:31:55,602 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-04 16:31:55,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:31:56,322 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 89 [2020-09-04 16:31:57,242 WARN L193 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 134 [2020-09-04 16:31:58,079 WARN L193 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 134 [2020-09-04 16:31:59,244 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 187 DAG size of output: 161 [2020-09-04 16:32:00,784 WARN L193 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 166 DAG size of output: 140 [2020-09-04 16:32:02,283 WARN L193 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 166 DAG size of output: 140 [2020-09-04 16:32:02,323 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:32:02,324 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:32:02,324 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:32:02,324 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:32:02,324 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:32:02,324 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:32:02,325 INFO L264 CegarLoopResult]: At program point sumEXIT(lines 3 9) the Hoare annotation is: (and (let ((.cse0 (= sum_~n |sum_#in~n|))) (or (and .cse0 (<= (+ |sum_#in~m| 25) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 24)))) (let ((.cse3 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#res| .cse3))) (or (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse1 .cse2) (and (<= (+ |sum_#in~m| 16) |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 16)) (and (<= (+ |sum_#in~m| 24) |sum_#res|) .cse1 .cse2) (and (<= (+ |sum_#in~m| 14) |sum_#res|) .cse1 (<= |sum_#in~n| 14) .cse2) (and .cse1 .cse2 (<= (+ |sum_#in~m| 9) |sum_#res|) (<= |sum_#in~n| 9)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 6)) (and (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse1 .cse2) (and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#in~n| 1) .cse1 .cse2) (and (<= |sum_#in~n| 4) .cse1 .cse2 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and (<= (+ |sum_#in~m| 10) |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 10)) (and (<= (+ |sum_#in~m| 23) |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 23)) (and .cse1 .cse2 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#res|)) (and (<= (+ |sum_#in~m| 11) |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 11)) (and .cse1 .cse2 (<= |sum_#in~n| 13) (<= (+ |sum_#in~m| 13) |sum_#res|)) (and (<= |sum_#in~n| 19) .cse1 .cse2 (<= (+ |sum_#in~m| 19) |sum_#res|)) (and (<= |sum_#in~n| 8) .cse1 .cse2 (<= (+ |sum_#in~m| 8) |sum_#res|)) (and (<= |sum_#in~n| 17) .cse1 .cse2 (<= (+ |sum_#in~m| 17) |sum_#res|)) (and (<= (+ |sum_#in~m| 18) |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 18)) (and (<= (+ |sum_#in~m| 15) |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 15)) (and (<= |sum_#in~n| 5) .cse1 .cse2 (<= (+ |sum_#in~m| 5) |sum_#res|)) (and .cse1 .cse2 (<= (+ |sum_#in~m| 21) |sum_#res|) (<= |sum_#in~n| 21)) (and .cse1 .cse2 (<= |sum_#in~n| 20) (<= (+ |sum_#in~m| 20) |sum_#res|)) (and .cse1 .cse2 (<= |sum_#in~n| 3) (<= (+ |sum_#in~m| 3) |sum_#res|)) (and (<= |sum_#res| |sum_#in~m|) .cse1 (<= .cse3 |sum_#res|)) (and (<= |sum_#in~n| 22) .cse1 .cse2 (<= (+ |sum_#in~m| 22) |sum_#res|)))))) [2020-09-04 16:32:02,325 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:32:02,326 INFO L264 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse1 (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|))) (.cse2 (= sum_~m |sum_#in~m|))) (or (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 21) |sum_#t~ret0|) (<= |sum_#in~n| 21)) (and .cse0 (<= (+ |sum_#in~m| 7) |sum_#t~ret0|) .cse1 (<= |sum_#in~n| 7) .cse2) (and .cse0 (<= (+ |sum_#in~m| 8) |sum_#t~ret0|) .cse1 (<= |sum_#in~n| 8) .cse2) (and .cse0 (<= (+ |sum_#in~m| 25) |sum_#t~ret0|) .cse1 .cse2) (and .cse0 (<= |sum_#in~n| 22) .cse1 .cse2 (<= (+ |sum_#in~m| 22) |sum_#t~ret0|)) (and .cse0 (<= (+ |sum_#in~m| 23) |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 23)) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 9) (<= (+ |sum_#in~m| 9) |sum_#t~ret0|)) (and .cse0 .cse1 (<= |sum_#in~n| 4) .cse2 (<= (+ |sum_#in~m| 4) |sum_#t~ret0|)) (and .cse0 (<= |sum_#in~n| 5) (<= (+ |sum_#in~m| 5) |sum_#t~ret0|) .cse1 .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 1) .cse2 (<= (+ |sum_#in~m| 1) |sum_#t~ret0|)) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret0|)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 14) |sum_#t~ret0|) (<= |sum_#in~n| 14)) (and .cse0 (<= |sum_#in~n| 19) .cse1 .cse2 (<= (+ |sum_#in~m| 19) |sum_#t~ret0|)) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 11) (<= (+ |sum_#in~m| 11) |sum_#t~ret0|)) (and .cse0 (<= (+ |sum_#in~m| 18) |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 18)) (and .cse0 (<= (+ |sum_#in~m| 20) |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 20)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 10) |sum_#t~ret0|) (<= |sum_#in~n| 10)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 15) |sum_#t~ret0|) (<= |sum_#in~n| 15)) (and .cse0 (<= (+ |sum_#in~m| 12) |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 12)) (and .cse0 .cse1 (<= |sum_#in~n| 2) .cse2 (<= (+ |sum_#in~m| 2) |sum_#t~ret0|)) (and .cse0 (<= |sum_#in~n| 24) .cse1 .cse2 (<= (+ |sum_#in~m| 24) |sum_#t~ret0|)) (and .cse0 (<= (+ |sum_#in~m| 13) |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 13)) (and .cse0 (<= (+ |sum_#in~m| 3) |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 3)) (and .cse0 (<= |sum_#in~n| 17) .cse1 .cse2 (<= (+ |sum_#in~m| 17) |sum_#t~ret0|)) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 16) (<= (+ |sum_#in~m| 16) |sum_#t~ret0|)))) [2020-09-04 16:32:02,326 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:32:02,327 INFO L264 CegarLoopResult]: At program point L7-2(line 7) the Hoare annotation is: (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse1 (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|))) (.cse2 (= sum_~m |sum_#in~m|))) (or (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 21) |sum_#t~ret0|) (<= |sum_#in~n| 21)) (and .cse0 (<= (+ |sum_#in~m| 7) |sum_#t~ret0|) .cse1 (<= |sum_#in~n| 7) .cse2) (and .cse0 (<= (+ |sum_#in~m| 8) |sum_#t~ret0|) .cse1 (<= |sum_#in~n| 8) .cse2) (and .cse0 (<= (+ |sum_#in~m| 25) |sum_#t~ret0|) .cse1 .cse2) (and .cse0 (<= |sum_#in~n| 22) .cse1 .cse2 (<= (+ |sum_#in~m| 22) |sum_#t~ret0|)) (and .cse0 (<= (+ |sum_#in~m| 23) |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 23)) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 9) (<= (+ |sum_#in~m| 9) |sum_#t~ret0|)) (and .cse0 .cse1 (<= |sum_#in~n| 4) .cse2 (<= (+ |sum_#in~m| 4) |sum_#t~ret0|)) (and .cse0 (<= |sum_#in~n| 5) (<= (+ |sum_#in~m| 5) |sum_#t~ret0|) .cse1 .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 1) .cse2 (<= (+ |sum_#in~m| 1) |sum_#t~ret0|)) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret0|)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 14) |sum_#t~ret0|) (<= |sum_#in~n| 14)) (and .cse0 (<= |sum_#in~n| 19) .cse1 .cse2 (<= (+ |sum_#in~m| 19) |sum_#t~ret0|)) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 11) (<= (+ |sum_#in~m| 11) |sum_#t~ret0|)) (and .cse0 (<= (+ |sum_#in~m| 18) |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 18)) (and .cse0 (<= (+ |sum_#in~m| 20) |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 20)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 10) |sum_#t~ret0|) (<= |sum_#in~n| 10)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 15) |sum_#t~ret0|) (<= |sum_#in~n| 15)) (and .cse0 (<= (+ |sum_#in~m| 12) |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 12)) (and .cse0 .cse1 (<= |sum_#in~n| 2) .cse2 (<= (+ |sum_#in~m| 2) |sum_#t~ret0|)) (and .cse0 (<= |sum_#in~n| 24) .cse1 .cse2 (<= (+ |sum_#in~m| 24) |sum_#t~ret0|)) (and .cse0 (<= (+ |sum_#in~m| 13) |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 13)) (and .cse0 (<= (+ |sum_#in~m| 3) |sum_#t~ret0|) .cse1 .cse2 (<= |sum_#in~n| 3)) (and .cse0 (<= |sum_#in~n| 17) .cse1 .cse2 (<= (+ |sum_#in~m| 17) |sum_#t~ret0|)) (and .cse0 .cse1 .cse2 (<= |sum_#in~n| 16) (<= (+ |sum_#in~m| 16) |sum_#t~ret0|)))) [2020-09-04 16:32:02,327 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:32:02,328 INFO L264 CegarLoopResult]: At program point L7-3(line 7) the Hoare annotation is: (let ((.cse29 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse1 (<= |sum_#t~ret0| .cse29)) (.cse2 (= sum_~m |sum_#in~m|)) (.cse3 (<= |sum_#res| .cse29))) (or (let ((.cse4 (+ |sum_#in~m| 9))) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 |sum_#res|) (<= |sum_#in~n| 9) (<= .cse4 |sum_#t~ret0|))) (let ((.cse5 (+ |sum_#in~m| 19))) (and .cse0 (<= |sum_#in~n| 19) .cse1 .cse2 .cse3 (<= .cse5 |sum_#res|) (<= .cse5 |sum_#t~ret0|))) (let ((.cse6 (+ |sum_#in~m| 20))) (and .cse0 (<= .cse6 |sum_#t~ret0|) .cse1 .cse2 .cse3 (<= |sum_#in~n| 20) (<= .cse6 |sum_#res|))) (let ((.cse7 (+ |sum_#in~m| 3))) (and .cse0 (<= .cse7 |sum_#t~ret0|) .cse1 .cse2 .cse3 (<= |sum_#in~n| 3) (<= .cse7 |sum_#res|))) (let ((.cse8 (+ |sum_#in~m| 2))) (and .cse0 .cse1 (<= .cse8 |sum_#res|) (<= |sum_#in~n| 2) .cse2 .cse3 (<= .cse8 |sum_#t~ret0|))) (let ((.cse9 (+ |sum_#in~m| 6))) (and .cse0 (<= .cse9 |sum_#res|) .cse1 .cse2 .cse3 (<= |sum_#in~n| 6) (<= .cse9 |sum_#t~ret0|))) (let ((.cse10 (+ |sum_#in~m| 4))) (and .cse0 .cse1 (<= |sum_#in~n| 4) .cse2 .cse3 (<= .cse10 |sum_#res|) (<= .cse10 |sum_#t~ret0|))) (let ((.cse11 (+ |sum_#in~m| 15))) (and .cse0 (<= .cse11 |sum_#res|) .cse1 .cse2 .cse3 (<= .cse11 |sum_#t~ret0|) (<= |sum_#in~n| 15))) (let ((.cse12 (+ |sum_#in~m| 7))) (and .cse0 (<= .cse12 |sum_#t~ret0|) .cse1 (<= .cse12 |sum_#res|) (<= |sum_#in~n| 7) .cse2 .cse3)) (let ((.cse13 (+ |sum_#in~m| 13))) (and .cse0 (<= .cse13 |sum_#t~ret0|) .cse1 .cse2 .cse3 (<= |sum_#in~n| 13) (<= .cse13 |sum_#res|))) (let ((.cse14 (+ |sum_#in~m| 11))) (and .cse0 (<= .cse14 |sum_#res|) .cse1 .cse2 .cse3 (<= |sum_#in~n| 11) (<= .cse14 |sum_#t~ret0|))) (let ((.cse15 (+ |sum_#in~m| 18))) (and .cse0 (<= .cse15 |sum_#t~ret0|) (<= .cse15 |sum_#res|) .cse1 .cse2 .cse3 (<= |sum_#in~n| 18))) (let ((.cse16 (+ |sum_#in~m| 8))) (and .cse0 (<= .cse16 |sum_#t~ret0|) .cse1 (<= |sum_#in~n| 8) .cse2 .cse3 (<= .cse16 |sum_#res|))) (let ((.cse17 (+ |sum_#in~m| 24))) (and .cse0 (<= .cse17 |sum_#res|) (<= |sum_#in~n| 24) .cse1 .cse2 .cse3 (<= .cse17 |sum_#t~ret0|))) (let ((.cse18 (+ |sum_#in~m| 1))) (and .cse0 (<= .cse18 |sum_#res|) .cse1 (<= |sum_#in~n| 1) .cse2 .cse3 (<= .cse18 |sum_#t~ret0|))) (let ((.cse19 (+ |sum_#in~m| 23))) (and .cse0 (<= .cse19 |sum_#t~ret0|) .cse1 (<= .cse19 |sum_#res|) .cse2 .cse3 (<= |sum_#in~n| 23))) (let ((.cse20 (+ |sum_#in~m| 10))) (and .cse0 (<= .cse20 |sum_#res|) .cse1 .cse2 (<= .cse20 |sum_#t~ret0|) .cse3 (<= |sum_#in~n| 10))) (let ((.cse21 (+ |sum_#in~m| 16))) (and .cse0 (<= .cse21 |sum_#res|) .cse1 .cse2 .cse3 (<= |sum_#in~n| 16) (<= .cse21 |sum_#t~ret0|))) (let ((.cse22 (+ |sum_#in~m| 12))) (and .cse0 (<= .cse22 |sum_#t~ret0|) .cse1 .cse2 .cse3 (<= |sum_#in~n| 12) (<= .cse22 |sum_#res|))) (let ((.cse23 (+ |sum_#in~m| 25))) (and .cse0 (<= .cse23 |sum_#t~ret0|) (<= .cse23 |sum_#res|) .cse1 .cse2 .cse3)) (let ((.cse24 (+ |sum_#in~m| 14))) (and .cse0 (<= .cse24 |sum_#res|) .cse1 .cse2 (<= .cse24 |sum_#t~ret0|) (<= |sum_#in~n| 14) .cse3)) (let ((.cse25 (+ |sum_#in~m| 21))) (and .cse0 .cse1 .cse2 .cse3 (<= .cse25 |sum_#res|) (<= .cse25 |sum_#t~ret0|) (<= |sum_#in~n| 21))) (let ((.cse26 (+ |sum_#in~m| 5))) (and .cse0 (<= |sum_#in~n| 5) (<= .cse26 |sum_#t~ret0|) .cse1 .cse2 .cse3 (<= .cse26 |sum_#res|))) (let ((.cse27 (+ |sum_#in~m| 17))) (and .cse0 (<= |sum_#in~n| 17) .cse1 .cse2 .cse3 (<= .cse27 |sum_#t~ret0|) (<= .cse27 |sum_#res|))) (let ((.cse28 (+ |sum_#in~m| 22))) (and .cse0 (<= |sum_#in~n| 22) .cse1 .cse2 .cse3 (<= .cse28 |sum_#res|) (<= .cse28 |sum_#t~ret0|)))))) [2020-09-04 16:32:02,328 INFO L264 CegarLoopResult]: At program point L3(lines 3 9) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-09-04 16:32:02,328 INFO L264 CegarLoopResult]: At program point sumFINAL(lines 3 9) the Hoare annotation is: (and (let ((.cse0 (= sum_~n |sum_#in~n|))) (or (and .cse0 (<= (+ |sum_#in~m| 25) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 24)))) (let ((.cse3 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#res| .cse3))) (or (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse1 .cse2) (and (<= (+ |sum_#in~m| 16) |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 16)) (and (<= (+ |sum_#in~m| 24) |sum_#res|) .cse1 .cse2) (and (<= (+ |sum_#in~m| 14) |sum_#res|) .cse1 (<= |sum_#in~n| 14) .cse2) (and .cse1 .cse2 (<= (+ |sum_#in~m| 9) |sum_#res|) (<= |sum_#in~n| 9)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 6)) (and (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse1 .cse2) (and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#in~n| 1) .cse1 .cse2) (and (<= |sum_#in~n| 4) .cse1 .cse2 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and (<= (+ |sum_#in~m| 10) |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 10)) (and (<= (+ |sum_#in~m| 23) |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 23)) (and .cse1 .cse2 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#res|)) (and (<= (+ |sum_#in~m| 11) |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 11)) (and .cse1 .cse2 (<= |sum_#in~n| 13) (<= (+ |sum_#in~m| 13) |sum_#res|)) (and (<= |sum_#in~n| 19) .cse1 .cse2 (<= (+ |sum_#in~m| 19) |sum_#res|)) (and (<= |sum_#in~n| 8) .cse1 .cse2 (<= (+ |sum_#in~m| 8) |sum_#res|)) (and (<= |sum_#in~n| 17) .cse1 .cse2 (<= (+ |sum_#in~m| 17) |sum_#res|)) (and (<= (+ |sum_#in~m| 18) |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 18)) (and (<= (+ |sum_#in~m| 15) |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 15)) (and (<= |sum_#in~n| 5) .cse1 .cse2 (<= (+ |sum_#in~m| 5) |sum_#res|)) (and .cse1 .cse2 (<= (+ |sum_#in~m| 21) |sum_#res|) (<= |sum_#in~n| 21)) (and .cse1 .cse2 (<= |sum_#in~n| 20) (<= (+ |sum_#in~m| 20) |sum_#res|)) (and .cse1 .cse2 (<= |sum_#in~n| 3) (<= (+ |sum_#in~m| 3) |sum_#res|)) (and (<= |sum_#res| |sum_#in~m|) .cse1 (<= .cse3 |sum_#res|)) (and (<= |sum_#in~n| 22) .cse1 .cse2 (<= (+ |sum_#in~m| 22) |sum_#res|)))))) [2020-09-04 16:32:02,328 INFO L271 CegarLoopResult]: At program point sumENTRY(lines 3 9) the Hoare annotation is: true [2020-09-04 16:32:02,329 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: false [2020-09-04 16:32:02,329 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2020-09-04 16:32:02,329 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 11 18) the Hoare annotation is: (<= 25 main_~a~0) [2020-09-04 16:32:02,329 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: false [2020-09-04 16:32:02,329 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 25) (<= main_~result~0 .cse0) (<= 25 main_~a~0))) [2020-09-04 16:32:02,329 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (and (<= main_~a~0 25) (<= 25 main_~a~0)) [2020-09-04 16:32:02,330 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= main_~a~0 25) (<= 25 main_~a~0)) [2020-09-04 16:32:02,330 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= |main_#t~ret1| .cse0) (<= .cse0 |main_#t~ret1|) (<= main_~a~0 25) (<= 25 main_~a~0))) [2020-09-04 16:32:02,330 INFO L264 CegarLoopResult]: At program point L15-2(lines 11 18) the Hoare annotation is: (<= 25 main_~a~0) [2020-09-04 16:32:02,330 INFO L264 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= |main_#t~ret1| .cse0) (<= .cse0 |main_#t~ret1|) (<= main_~a~0 25) (<= 25 main_~a~0))) [2020-09-04 16:32:02,330 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_#t~ret1| .cse0) (<= .cse0 |main_#t~ret1|) (<= main_~a~0 25) (<= main_~result~0 .cse0) (<= 25 main_~a~0))) [2020-09-04 16:32:02,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:32:02 BoogieIcfgContainer [2020-09-04 16:32:02,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:32:02,369 INFO L168 Benchmark]: Toolchain (without parser) took 47327.41 ms. Allocated memory was 144.2 MB in the beginning and 846.7 MB in the end (delta: 702.5 MB). Free memory was 101.6 MB in the beginning and 377.2 MB in the end (delta: -275.7 MB). Peak memory consumption was 721.7 MB. Max. memory is 7.1 GB. [2020-09-04 16:32:02,369 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.2 MB. Free memory was 119.8 MB in the beginning and 119.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 16:32:02,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.59 ms. Allocated memory is still 144.2 MB. Free memory was 101.4 MB in the beginning and 92.1 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:32:02,370 INFO L168 Benchmark]: Boogie Preprocessor took 29.71 ms. Allocated memory is still 144.2 MB. Free memory was 92.1 MB in the beginning and 90.7 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:32:02,371 INFO L168 Benchmark]: RCFGBuilder took 386.22 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 90.7 MB in the beginning and 168.2 MB in the end (delta: -77.5 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-09-04 16:32:02,372 INFO L168 Benchmark]: TraceAbstraction took 46584.97 ms. Allocated memory was 200.8 MB in the beginning and 846.7 MB in the end (delta: 645.9 MB). Free memory was 167.5 MB in the beginning and 377.2 MB in the end (delta: -209.7 MB). Peak memory consumption was 731.0 MB. Max. memory is 7.1 GB. [2020-09-04 16:32:02,375 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.23 ms. Allocated memory is still 144.2 MB. Free memory was 119.8 MB in the beginning and 119.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 309.59 ms. Allocated memory is still 144.2 MB. Free memory was 101.4 MB in the beginning and 92.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.71 ms. Allocated memory is still 144.2 MB. Free memory was 92.1 MB in the beginning and 90.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 386.22 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 90.7 MB in the beginning and 168.2 MB in the end (delta: -77.5 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46584.97 ms. Allocated memory was 200.8 MB in the beginning and 846.7 MB in the end (delta: 645.9 MB). Free memory was 167.5 MB in the beginning and 377.2 MB in the end (delta: -209.7 MB). Peak memory consumption was 731.0 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: ((n == \old(n) && \old(m) + 25 <= \result) || (n == \old(n) && \old(n) <= 24)) && (((((((((((((((((((((((((((\old(m) + 2 <= \result && \old(n) <= 2) && m == \old(m)) && \result <= \old(n) + \old(m)) || (((\old(m) + 16 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 16)) || ((\old(m) + 24 <= \result && m == \old(m)) && \result <= \old(n) + \old(m))) || (((\old(m) + 14 <= \result && m == \old(m)) && \old(n) <= 14) && \result <= \old(n) + \old(m))) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 9 <= \result) && \old(n) <= 9)) || (((\old(m) + 6 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 6)) || (((\old(m) + 7 <= \result && \old(n) <= 7) && m == \old(m)) && \result <= \old(n) + \old(m))) || (((\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) + 10 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 10)) || (((\old(m) + 23 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 23)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 12) && \old(m) + 12 <= \result)) || (((\old(m) + 11 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 11)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 13) && \old(m) + 13 <= \result)) || (((\old(n) <= 19 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 19 <= \result)) || (((\old(n) <= 8 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 8 <= \result)) || (((\old(n) <= 17 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 17 <= \result)) || (((\old(m) + 18 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 18)) || (((\old(m) + 15 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 15)) || (((\old(n) <= 5 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 5 <= \result)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 21 <= \result) && \old(n) <= 21)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 20) && \old(m) + 20 <= \result)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 3) && \old(m) + 3 <= \result)) || ((\result <= \old(m) && m == \old(m)) && \old(n) + \old(m) <= \result)) || (((\old(n) <= 22 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 22 <= \result)) - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 25 <= a - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 39.7s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 515 SDtfs, 1601 SDslu, 3254 SDs, 0 SdLazy, 2463 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1642 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 837 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7537 ImplicationChecksByTransitivity, 17.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 37 PreInvPairs, 412 NumberOfFragments, 2754 HoareAnnotationTreeSize, 37 FomulaSimplifications, 2690 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 27 FomulaSimplificationsInter, 1122 FormulaSimplificationTreeSizeReductionInter, 5.8s 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...