/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_15x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:30:57,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:30:57,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:30:57,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:30:57,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:30:57,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:30:57,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:30:57,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:30:57,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:30:57,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:30:57,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:30:57,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:30:57,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:30:57,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:30:57,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:30:57,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:30:57,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:30:57,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:30:57,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:30:57,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:30:57,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:30:57,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:30:57,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:30:57,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:30:57,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:30:57,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:30:57,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:30:57,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:30:57,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:30:57,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:30:57,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:30:57,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:30:57,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:30:57,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:30:57,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:30:57,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:30:57,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:30:57,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:30:57,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:30:57,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:30:57,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:30:57,102 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 16:30:57,137 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:30:57,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:30:57,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:30:57,143 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:30:57,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:30:57,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:30:57,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:30:57,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:30:57,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:30:57,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:30:57,147 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:30:57,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:30:57,147 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:30:57,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:30:57,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:30:57,148 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:30:57,148 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:30:57,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:30:57,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:30:57,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:30:57,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:30:57,149 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:30:57,150 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:30:57,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:30:57,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:30:57,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:30:57,642 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:30:57,642 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:30:57,643 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_15x0-2.c [2020-09-04 16:30:57,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e3b985019/8793dead0b4c4637a08f9c71a9f46dc0/FLAG9f026e5a4 [2020-09-04 16:30:58,326 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:30:58,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/sum_15x0-2.c [2020-09-04 16:30:58,335 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e3b985019/8793dead0b4c4637a08f9c71a9f46dc0/FLAG9f026e5a4 [2020-09-04 16:30:58,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e3b985019/8793dead0b4c4637a08f9c71a9f46dc0 [2020-09-04 16:30:58,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:30:58,691 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:30:58,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:30:58,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:30:58,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:30:58,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:30:58" (1/1) ... [2020-09-04 16:30:58,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240fc400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:58, skipping insertion in model container [2020-09-04 16:30:58,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:30:58" (1/1) ... [2020-09-04 16:30:58,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:30:58,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:30:58,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:30:58,973 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:30:58,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:30:59,007 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:30:59,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:59 WrapperNode [2020-09-04 16:30:59,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:30:59,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:30:59,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:30:59,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:30:59,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:59" (1/1) ... [2020-09-04 16:30:59,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:59" (1/1) ... [2020-09-04 16:30:59,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:59" (1/1) ... [2020-09-04 16:30:59,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:59" (1/1) ... [2020-09-04 16:30:59,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:59" (1/1) ... [2020-09-04 16:30:59,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:59" (1/1) ... [2020-09-04 16:30:59,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:59" (1/1) ... [2020-09-04 16:30:59,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:30:59,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:30:59,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:30:59,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:30:59,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:59" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:30:59,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:30:59,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:30:59,191 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-09-04 16:30:59,191 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:30:59,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:30:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-09-04 16:30:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:30:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:30:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:30:59,421 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:30:59,422 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:30:59,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:30:59 BoogieIcfgContainer [2020-09-04 16:30:59,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:30:59,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:30:59,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:30:59,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:30:59,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:30:58" (1/3) ... [2020-09-04 16:30:59,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2857eee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:30:59, skipping insertion in model container [2020-09-04 16:30:59,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:30:59" (2/3) ... [2020-09-04 16:30:59,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2857eee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:30:59, skipping insertion in model container [2020-09-04 16:30:59,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:30:59" (3/3) ... [2020-09-04 16:30:59,455 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_15x0-2.c [2020-09-04 16:30:59,483 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:30:59,496 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:30:59,535 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:30:59,564 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:30:59,565 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:30:59,565 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:30:59,565 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:30:59,565 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:30:59,566 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:30:59,566 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:30:59,566 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:30:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-09-04 16:30:59,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-04 16:30:59,599 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:30:59,600 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:30:59,601 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:30:59,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:30:59,608 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-09-04 16:30:59,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:30:59,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1242305614] [2020-09-04 16:30:59,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:30:59,688 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:30:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:59,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:30:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:59,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:30:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:30:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:30:59,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1242305614] [2020-09-04 16:30:59,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:30:59,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:30:59,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89948385] [2020-09-04 16:30:59,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:30:59,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:30:59,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:30:59,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:30:59,943 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-09-04 16:31:00,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:00,051 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-09-04 16:31:00,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:31:00,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-09-04 16:31:00,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:00,066 INFO L225 Difference]: With dead ends: 39 [2020-09-04 16:31:00,066 INFO L226 Difference]: Without dead ends: 25 [2020-09-04 16:31:00,070 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:00,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-09-04 16:31:00,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-09-04 16:31:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-09-04 16:31:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-09-04 16:31:00,126 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-09-04 16:31:00,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:00,127 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-09-04 16:31:00,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:31:00,127 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-09-04 16:31:00,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 16:31:00,130 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:00,130 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:00,131 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:31:00,131 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:00,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:00,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-09-04 16:31:00,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:00,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [53391339] [2020-09-04 16:31:00,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:00,135 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:00,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:00,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:00,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:00,275 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:00,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [53391339] [2020-09-04 16:31:00,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:00,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:31:00,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227903651] [2020-09-04 16:31:00,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:31:00,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:00,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:31:00,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:31:00,280 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2020-09-04 16:31:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:00,375 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-09-04 16:31:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:31:00,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-09-04 16:31:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:00,378 INFO L225 Difference]: With dead ends: 36 [2020-09-04 16:31:00,378 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 16:31:00,380 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:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 16:31:00,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 16:31:00,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 16:31:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-09-04 16:31:00,393 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2020-09-04 16:31:00,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:00,394 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-09-04 16:31:00,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:31:00,394 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-09-04 16:31:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 16:31:00,396 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:00,396 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:00,396 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:31:00,397 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:00,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash -175020829, now seen corresponding path program 2 times [2020-09-04 16:31:00,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:00,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1094249488] [2020-09-04 16:31:00,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:00,401 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:00,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:00,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:00,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:00,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:00,581 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:00,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1094249488] [2020-09-04 16:31:00,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:00,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:31:00,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321438145] [2020-09-04 16:31:00,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:31:00,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:00,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:31:00,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:31:00,585 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2020-09-04 16:31:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:00,678 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-09-04 16:31:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:31:00,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-09-04 16:31:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:00,680 INFO L225 Difference]: With dead ends: 41 [2020-09-04 16:31:00,680 INFO L226 Difference]: Without dead ends: 35 [2020-09-04 16:31:00,681 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:00,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-09-04 16:31:00,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-09-04 16:31:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-09-04 16:31:00,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-09-04 16:31:00,694 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 36 [2020-09-04 16:31:00,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:00,695 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-09-04 16:31:00,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:31:00,695 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-09-04 16:31:00,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-09-04 16:31:00,697 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:00,697 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:00,697 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:31:00,698 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:00,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:00,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1021564803, now seen corresponding path program 3 times [2020-09-04 16:31:00,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:00,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1156482664] [2020-09-04 16:31:00,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:00,701 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:00,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:00,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:00,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:00,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:00,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:01,006 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:01,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1156482664] [2020-09-04 16:31:01,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:01,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:31:01,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229318780] [2020-09-04 16:31:01,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:31:01,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:01,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:31:01,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:31:01,009 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 8 states. [2020-09-04 16:31:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:01,098 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-09-04 16:31:01,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:31:01,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-09-04 16:31:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:01,100 INFO L225 Difference]: With dead ends: 46 [2020-09-04 16:31:01,101 INFO L226 Difference]: Without dead ends: 40 [2020-09-04 16:31:01,102 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:31:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-09-04 16:31:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-09-04 16:31:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-09-04 16:31:01,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-09-04 16:31:01,113 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 45 [2020-09-04 16:31:01,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:01,114 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-09-04 16:31:01,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:31:01,114 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-09-04 16:31:01,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 16:31:01,116 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:01,116 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:01,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:31:01,117 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:01,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:01,118 INFO L82 PathProgramCache]: Analyzing trace with hash -263249715, now seen corresponding path program 4 times [2020-09-04 16:31:01,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:01,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1219422628] [2020-09-04 16:31:01,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:01,121 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:01,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:01,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:01,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:01,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:01,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:01,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:01,365 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:01,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1219422628] [2020-09-04 16:31:01,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:01,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:31:01,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389726720] [2020-09-04 16:31:01,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:31:01,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:01,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:31:01,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:31:01,368 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2020-09-04 16:31:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:01,458 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-09-04 16:31:01,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:31:01,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-09-04 16:31:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:01,461 INFO L225 Difference]: With dead ends: 51 [2020-09-04 16:31:01,461 INFO L226 Difference]: Without dead ends: 45 [2020-09-04 16:31:01,462 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:01,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-04 16:31:01,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-09-04 16:31:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-04 16:31:01,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-09-04 16:31:01,474 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 54 [2020-09-04 16:31:01,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:01,475 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-09-04 16:31:01,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:31:01,475 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-09-04 16:31:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 16:31:01,480 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:01,480 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:01,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:31:01,480 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:01,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:01,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1884999187, now seen corresponding path program 5 times [2020-09-04 16:31:01,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:01,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [171297496] [2020-09-04 16:31:01,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:01,488 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:01,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:01,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:01,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:01,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:01,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:01,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:01,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:01,823 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:01,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [171297496] [2020-09-04 16:31:01,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:01,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:31:01,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732155642] [2020-09-04 16:31:01,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:31:01,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:01,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:31:01,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:31:01,829 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 10 states. [2020-09-04 16:31:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:01,964 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-09-04 16:31:01,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:31:01,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-09-04 16:31:01,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:01,971 INFO L225 Difference]: With dead ends: 56 [2020-09-04 16:31:01,971 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 16:31:01,974 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:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 16:31:01,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 16:31:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 16:31:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-09-04 16:31:01,997 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 63 [2020-09-04 16:31:01,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:01,998 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-09-04 16:31:01,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:31:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-09-04 16:31:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 16:31:02,006 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:02,006 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:02,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:31:02,008 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:02,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:02,009 INFO L82 PathProgramCache]: Analyzing trace with hash -441437769, now seen corresponding path program 6 times [2020-09-04 16:31:02,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:02,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [925752071] [2020-09-04 16:31:02,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:02,012 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,335 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:02,335 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [925752071] [2020-09-04 16:31:02,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:02,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:31:02,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131163767] [2020-09-04 16:31:02,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:31:02,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:02,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:31:02,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:31:02,340 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 11 states. [2020-09-04 16:31:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:02,484 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-09-04 16:31:02,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:31:02,485 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-09-04 16:31:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:02,487 INFO L225 Difference]: With dead ends: 61 [2020-09-04 16:31:02,489 INFO L226 Difference]: Without dead ends: 55 [2020-09-04 16:31:02,490 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:02,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-09-04 16:31:02,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-09-04 16:31:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 16:31:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-09-04 16:31:02,504 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 72 [2020-09-04 16:31:02,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:02,504 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-09-04 16:31:02,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:31:02,505 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-09-04 16:31:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-09-04 16:31:02,506 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:02,506 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:02,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:31:02,507 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:02,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:02,507 INFO L82 PathProgramCache]: Analyzing trace with hash 999943849, now seen corresponding path program 7 times [2020-09-04 16:31:02,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:02,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1477010646] [2020-09-04 16:31:02,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:02,510 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:02,825 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:02,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1477010646] [2020-09-04 16:31:02,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:02,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:31:02,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666686368] [2020-09-04 16:31:02,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:31:02,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:02,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:31:02,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:31:02,828 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 12 states. [2020-09-04 16:31:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:02,972 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-09-04 16:31:02,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:31:02,972 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-09-04 16:31:02,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:02,974 INFO L225 Difference]: With dead ends: 66 [2020-09-04 16:31:02,974 INFO L226 Difference]: Without dead ends: 60 [2020-09-04 16:31:02,976 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:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-04 16:31:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-09-04 16:31:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-09-04 16:31:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-09-04 16:31:02,987 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 81 [2020-09-04 16:31:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:02,987 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-09-04 16:31:02,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:31:02,988 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-09-04 16:31:02,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-09-04 16:31:02,989 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:02,989 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:02,990 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:31:02,990 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:02,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:02,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1356134305, now seen corresponding path program 8 times [2020-09-04 16:31:02,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:02,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1650676400] [2020-09-04 16:31:02,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:02,993 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,430 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:03,430 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1650676400] [2020-09-04 16:31:03,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:03,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:31:03,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043110637] [2020-09-04 16:31:03,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:31:03,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:03,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:31:03,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:31:03,433 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 13 states. [2020-09-04 16:31:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:03,597 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-09-04 16:31:03,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:31:03,598 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-09-04 16:31:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:03,600 INFO L225 Difference]: With dead ends: 71 [2020-09-04 16:31:03,600 INFO L226 Difference]: Without dead ends: 65 [2020-09-04 16:31:03,602 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:03,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-09-04 16:31:03,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-09-04 16:31:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-09-04 16:31:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-09-04 16:31:03,613 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 90 [2020-09-04 16:31:03,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:03,613 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-09-04 16:31:03,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:31:03,614 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-09-04 16:31:03,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-09-04 16:31:03,615 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:03,615 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:03,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:31:03,616 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:03,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:03,616 INFO L82 PathProgramCache]: Analyzing trace with hash -928437697, now seen corresponding path program 9 times [2020-09-04 16:31:03,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:03,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1505806760] [2020-09-04 16:31:03,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:03,619 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:03,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,108 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:04,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1505806760] [2020-09-04 16:31:04,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:04,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:31:04,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438190343] [2020-09-04 16:31:04,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:31:04,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:04,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:31:04,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:31:04,112 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2020-09-04 16:31:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:04,303 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-09-04 16:31:04,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:31:04,304 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-09-04 16:31:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:04,305 INFO L225 Difference]: With dead ends: 76 [2020-09-04 16:31:04,305 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 16:31:04,307 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:04,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 16:31:04,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 16:31:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 16:31:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-09-04 16:31:04,318 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 99 [2020-09-04 16:31:04,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:04,319 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-09-04 16:31:04,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:31:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-09-04 16:31:04,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 16:31:04,321 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:04,321 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:04,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:31:04,321 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:04,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:04,322 INFO L82 PathProgramCache]: Analyzing trace with hash -276966773, now seen corresponding path program 10 times [2020-09-04 16:31:04,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:04,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [758345865] [2020-09-04 16:31:04,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:04,325 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:04,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,010 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:05,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [758345865] [2020-09-04 16:31:05,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:05,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:31:05,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962569719] [2020-09-04 16:31:05,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:31:05,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:05,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:31:05,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:31:05,016 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 15 states. [2020-09-04 16:31:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:05,249 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-09-04 16:31:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 16:31:05,249 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-09-04 16:31:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:05,251 INFO L225 Difference]: With dead ends: 81 [2020-09-04 16:31:05,251 INFO L226 Difference]: Without dead ends: 75 [2020-09-04 16:31:05,258 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-09-04 16:31:05,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-04 16:31:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-09-04 16:31:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-09-04 16:31:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-09-04 16:31:05,281 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 108 [2020-09-04 16:31:05,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:05,282 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-09-04 16:31:05,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:31:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-09-04 16:31:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-09-04 16:31:05,284 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:05,284 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:05,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:31:05,285 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:05,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:05,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1749540651, now seen corresponding path program 11 times [2020-09-04 16:31:05,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:05,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1444376531] [2020-09-04 16:31:05,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:05,314 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:05,978 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:05,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1444376531] [2020-09-04 16:31:05,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:05,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:31:05,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483394842] [2020-09-04 16:31:05,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:31:05,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:05,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:31:05,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:31:05,983 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 16 states. [2020-09-04 16:31:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:06,221 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-09-04 16:31:06,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:31:06,222 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-09-04 16:31:06,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:06,224 INFO L225 Difference]: With dead ends: 86 [2020-09-04 16:31:06,224 INFO L226 Difference]: Without dead ends: 80 [2020-09-04 16:31:06,225 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:31:06,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-09-04 16:31:06,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-09-04 16:31:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-09-04 16:31:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2020-09-04 16:31:06,257 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 117 [2020-09-04 16:31:06,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:06,258 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2020-09-04 16:31:06,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:31:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2020-09-04 16:31:06,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-09-04 16:31:06,260 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:06,263 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:06,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:31:06,264 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:06,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:06,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1141580405, now seen corresponding path program 12 times [2020-09-04 16:31:06,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:06,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1170327522] [2020-09-04 16:31:06,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:06,268 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:06,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,021 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:07,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1170327522] [2020-09-04 16:31:07,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:07,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:31:07,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399589389] [2020-09-04 16:31:07,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:31:07,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:07,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:31:07,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:31:07,025 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 17 states. [2020-09-04 16:31:07,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:07,256 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-09-04 16:31:07,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 16:31:07,257 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-09-04 16:31:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:07,258 INFO L225 Difference]: With dead ends: 91 [2020-09-04 16:31:07,259 INFO L226 Difference]: Without dead ends: 85 [2020-09-04 16:31:07,260 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:07,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-09-04 16:31:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-09-04 16:31:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-09-04 16:31:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2020-09-04 16:31:07,271 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 126 [2020-09-04 16:31:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:07,272 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2020-09-04 16:31:07,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:31:07,272 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2020-09-04 16:31:07,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-04 16:31:07,274 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:07,274 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:07,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:31:07,275 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:07,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:07,276 INFO L82 PathProgramCache]: Analyzing trace with hash 55997035, now seen corresponding path program 13 times [2020-09-04 16:31:07,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:07,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [644791490] [2020-09-04 16:31:07,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:07,278 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:07,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,150 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:08,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [644791490] [2020-09-04 16:31:08,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:08,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 16:31:08,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314061446] [2020-09-04 16:31:08,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 16:31:08,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:08,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 16:31:08,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:31:08,154 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 18 states. [2020-09-04 16:31:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:08,374 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-09-04 16:31:08,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:31:08,374 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-09-04 16:31:08,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:08,376 INFO L225 Difference]: With dead ends: 96 [2020-09-04 16:31:08,376 INFO L226 Difference]: Without dead ends: 90 [2020-09-04 16:31:08,377 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:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-09-04 16:31:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-09-04 16:31:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-09-04 16:31:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2020-09-04 16:31:08,386 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 135 [2020-09-04 16:31:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:08,387 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2020-09-04 16:31:08,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 16:31:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2020-09-04 16:31:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-09-04 16:31:08,389 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:08,389 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:08,389 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 16:31:08,389 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:08,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:08,390 INFO L82 PathProgramCache]: Analyzing trace with hash 394086239, now seen corresponding path program 14 times [2020-09-04 16:31:08,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:08,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [102357584] [2020-09-04 16:31:08,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:08,392 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:08,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:09,365 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:09,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [102357584] [2020-09-04 16:31:09,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:09,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 16:31:09,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510821810] [2020-09-04 16:31:09,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 16:31:09,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:09,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 16:31:09,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:31:09,368 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 19 states. [2020-09-04 16:31:09,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:09,647 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-09-04 16:31:09,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:31:09,647 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-09-04 16:31:09,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:09,649 INFO L225 Difference]: With dead ends: 101 [2020-09-04 16:31:09,649 INFO L226 Difference]: Without dead ends: 95 [2020-09-04 16:31:09,651 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 16:31:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-09-04 16:31:09,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-09-04 16:31:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 16:31:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2020-09-04 16:31:09,661 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 144 [2020-09-04 16:31:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:09,662 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2020-09-04 16:31:09,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 16:31:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2020-09-04 16:31:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-04 16:31:09,664 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:09,664 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:09,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 16:31:09,665 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:09,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:09,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1047772929, now seen corresponding path program 15 times [2020-09-04 16:31:09,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:09,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [745714486] [2020-09-04 16:31:09,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:09,668 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 16:31:09,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 16:31:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 16:31:09,735 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 16:31:09,785 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 16:31:09,786 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 16:31:09,787 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 16:31:09,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:31:09 BoogieIcfgContainer [2020-09-04 16:31:09,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:31:09,830 INFO L168 Benchmark]: Toolchain (without parser) took 11137.78 ms. Allocated memory was 138.4 MB in the beginning and 416.8 MB in the end (delta: 278.4 MB). Free memory was 101.9 MB in the beginning and 170.4 MB in the end (delta: -68.5 MB). Peak memory consumption was 209.9 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:09,831 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 138.4 MB. Free memory was 119.7 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:31:09,831 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.02 ms. Allocated memory is still 138.4 MB. Free memory was 101.7 MB in the beginning and 92.4 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:31:09,832 INFO L168 Benchmark]: Boogie Preprocessor took 29.66 ms. Allocated memory is still 138.4 MB. Free memory was 92.4 MB in the beginning and 91.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:09,833 INFO L168 Benchmark]: RCFGBuilder took 389.49 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 91.0 MB in the beginning and 169.1 MB in the end (delta: -78.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:09,834 INFO L168 Benchmark]: TraceAbstraction took 10384.06 ms. Allocated memory was 201.3 MB in the beginning and 416.8 MB in the end (delta: 215.5 MB). Free memory was 168.4 MB in the beginning and 170.4 MB in the end (delta: -1.9 MB). Peak memory consumption was 213.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:09,837 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.26 ms. Allocated memory is still 138.4 MB. Free memory was 119.7 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 316.02 ms. Allocated memory is still 138.4 MB. Free memory was 101.7 MB in the beginning and 92.4 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.66 ms. Allocated memory is still 138.4 MB. Free memory was 92.4 MB in the beginning and 91.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 389.49 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 91.0 MB in the beginning and 169.1 MB in the end (delta: -78.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10384.06 ms. Allocated memory was 201.3 MB in the beginning and 416.8 MB in the end (delta: 215.5 MB). Free memory was 168.4 MB in the beginning and 170.4 MB in the end (delta: -1.9 MB). Peak memory consumption was 213.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 15; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND TRUE n <= 0 [L5] return m + n; [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.2s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 273 SDtfs, 632 SDslu, 1188 SDs, 0 SdLazy, 558 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 555 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 incorrect! Received shutdown request...