/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/id_i15_o15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:29:19,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:29:19,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:29:19,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:29:19,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:29:19,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:29:19,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:29:19,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:29:19,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:29:19,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:29:19,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:29:19,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:29:19,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:29:19,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:29:19,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:29:19,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:29:19,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:29:19,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:29:19,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:29:19,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:29:19,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:29:19,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:29:19,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:29:19,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:29:19,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:29:19,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:29:19,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:29:19,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:29:19,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:29:19,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:29:19,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:29:19,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:29:19,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:29:19,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:29:19,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:29:19,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:29:19,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:29:19,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:29:19,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:29:19,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:29:19,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:29:19,727 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:29:19,743 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:29:19,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:29:19,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:29:19,745 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:29:19,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:29:19,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:29:19,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:29:19,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:29:19,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:29:19,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:29:19,747 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:29:19,747 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:29:19,747 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:29:19,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:29:19,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:29:19,748 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:29:19,748 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:29:19,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:29:19,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:29:19,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:29:19,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:29:19,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:29:19,750 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:29:20,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:29:20,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:29:20,308 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:29:20,311 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:29:20,311 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:29:20,313 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i15_o15-2.c [2020-09-04 16:29:20,418 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7878fd0d3/19e0c37ca15147d78b03f8ff16fb4a08/FLAG2f993ec5b [2020-09-04 16:29:21,145 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:29:21,146 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i15_o15-2.c [2020-09-04 16:29:21,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7878fd0d3/19e0c37ca15147d78b03f8ff16fb4a08/FLAG2f993ec5b [2020-09-04 16:29:21,455 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7878fd0d3/19e0c37ca15147d78b03f8ff16fb4a08 [2020-09-04 16:29:21,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:29:21,474 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:29:21,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:29:21,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:29:21,480 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:29:21,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:29:21" (1/1) ... [2020-09-04 16:29:21,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@621684ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:21, skipping insertion in model container [2020-09-04 16:29:21,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:29:21" (1/1) ... [2020-09-04 16:29:21,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:29:21,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:29:21,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:29:21,750 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:29:21,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:29:21,792 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:29:21,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:21 WrapperNode [2020-09-04 16:29:21,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:29:21,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:29:21,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:29:21,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:29:21,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:21" (1/1) ... [2020-09-04 16:29:21,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:21" (1/1) ... [2020-09-04 16:29:21,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:21" (1/1) ... [2020-09-04 16:29:21,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:21" (1/1) ... [2020-09-04 16:29:21,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:21" (1/1) ... [2020-09-04 16:29:21,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:21" (1/1) ... [2020-09-04 16:29:21,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:21" (1/1) ... [2020-09-04 16:29:21,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:29:21,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:29:21,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:29:21,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:29:21,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:21" (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:29:22,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:29:22,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:29:22,039 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 16:29:22,039 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:29:22,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:29:22,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:29:22,039 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 16:29:22,040 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:29:22,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:29:22,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:29:22,265 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:29:22,266 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:29:22,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:29:22 BoogieIcfgContainer [2020-09-04 16:29:22,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:29:22,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:29:22,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:29:22,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:29:22,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:29:21" (1/3) ... [2020-09-04 16:29:22,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec6f73d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:29:22, skipping insertion in model container [2020-09-04 16:29:22,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:29:21" (2/3) ... [2020-09-04 16:29:22,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec6f73d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:29:22, skipping insertion in model container [2020-09-04 16:29:22,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:29:22" (3/3) ... [2020-09-04 16:29:22,284 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i15_o15-2.c [2020-09-04 16:29:22,307 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:29:22,320 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:29:22,351 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:29:22,395 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:29:22,395 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:29:22,396 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:29:22,396 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:29:22,396 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:29:22,396 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:29:22,396 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:29:22,396 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:29:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-09-04 16:29:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 16:29:22,454 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:22,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:22,460 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:22,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1037734449, now seen corresponding path program 1 times [2020-09-04 16:29:22,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:22,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1157648065] [2020-09-04 16:29:22,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:22,586 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:22,764 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:29:22,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1157648065] [2020-09-04 16:29:22,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:22,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:29:22,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547865553] [2020-09-04 16:29:22,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:29:22,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:22,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:29:22,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:29:22,802 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2020-09-04 16:29:22,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:22,912 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-09-04 16:29:22,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:29:22,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 16:29:22,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:22,930 INFO L225 Difference]: With dead ends: 37 [2020-09-04 16:29:22,930 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 16:29:22,935 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:29:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 16:29:22,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-04 16:29:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-04 16:29:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-09-04 16:29:22,995 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2020-09-04 16:29:22,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:22,996 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-09-04 16:29:22,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:29:22,996 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-09-04 16:29:22,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 16:29:22,999 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:22,999 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:23,000 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:29:23,000 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:23,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:23,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1478812441, now seen corresponding path program 1 times [2020-09-04 16:29:23,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:23,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1411131238] [2020-09-04 16:29:23,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:23,005 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:29:23,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1411131238] [2020-09-04 16:29:23,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:23,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:29:23,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387321302] [2020-09-04 16:29:23,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:29:23,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:23,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:29:23,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:29:23,148 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2020-09-04 16:29:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:23,248 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-04 16:29:23,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:29:23,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-04 16:29:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:23,251 INFO L225 Difference]: With dead ends: 34 [2020-09-04 16:29:23,251 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 16:29:23,253 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:29:23,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 16:29:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 16:29:23,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 16:29:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-09-04 16:29:23,266 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2020-09-04 16:29:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:23,267 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-09-04 16:29:23,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:29:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-09-04 16:29:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-09-04 16:29:23,269 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:23,269 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:23,270 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:29:23,270 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:23,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:23,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1463730447, now seen corresponding path program 2 times [2020-09-04 16:29:23,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:23,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1905565341] [2020-09-04 16:29:23,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:23,274 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 16:29:23,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1905565341] [2020-09-04 16:29:23,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:23,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:29:23,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472508403] [2020-09-04 16:29:23,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:29:23,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:23,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:29:23,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:29:23,479 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-09-04 16:29:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:23,561 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-09-04 16:29:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:29:23,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-09-04 16:29:23,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:23,564 INFO L225 Difference]: With dead ends: 39 [2020-09-04 16:29:23,565 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 16:29:23,566 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:29:23,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 16:29:23,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-04 16:29:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-04 16:29:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-04 16:29:23,584 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2020-09-04 16:29:23,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:23,585 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-04 16:29:23,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:29:23,585 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-04 16:29:23,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 16:29:23,587 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:23,587 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:23,588 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:29:23,588 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:23,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:23,589 INFO L82 PathProgramCache]: Analyzing trace with hash 23346727, now seen corresponding path program 3 times [2020-09-04 16:29:23,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:23,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [88829836] [2020-09-04 16:29:23,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:23,592 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-09-04 16:29:23,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [88829836] [2020-09-04 16:29:23,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:23,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:29:23,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483290656] [2020-09-04 16:29:23,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:29:23,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:23,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:29:23,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:29:23,880 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2020-09-04 16:29:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:24,004 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-09-04 16:29:24,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:29:24,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-09-04 16:29:24,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:24,007 INFO L225 Difference]: With dead ends: 44 [2020-09-04 16:29:24,008 INFO L226 Difference]: Without dead ends: 38 [2020-09-04 16:29:24,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:29:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-04 16:29:24,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-09-04 16:29:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 16:29:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-09-04 16:29:24,024 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 40 [2020-09-04 16:29:24,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:24,025 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-09-04 16:29:24,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:29:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-09-04 16:29:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 16:29:24,032 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:24,033 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:24,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:29:24,033 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:24,034 INFO L82 PathProgramCache]: Analyzing trace with hash -649675855, now seen corresponding path program 4 times [2020-09-04 16:29:24,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:24,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [826155337] [2020-09-04 16:29:24,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:24,037 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 16:29:24,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [826155337] [2020-09-04 16:29:24,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:24,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:29:24,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227960219] [2020-09-04 16:29:24,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:29:24,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:24,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:29:24,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:29:24,266 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 9 states. [2020-09-04 16:29:24,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:24,372 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-04 16:29:24,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:29:24,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-09-04 16:29:24,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:24,375 INFO L225 Difference]: With dead ends: 49 [2020-09-04 16:29:24,376 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 16:29:24,376 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:29:24,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 16:29:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-09-04 16:29:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-09-04 16:29:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-09-04 16:29:24,389 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 48 [2020-09-04 16:29:24,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:24,389 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-09-04 16:29:24,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:29:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-09-04 16:29:24,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 16:29:24,392 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:24,392 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:24,393 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:29:24,393 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:24,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:24,393 INFO L82 PathProgramCache]: Analyzing trace with hash 899977063, now seen corresponding path program 5 times [2020-09-04 16:29:24,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:24,394 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2130590434] [2020-09-04 16:29:24,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:24,396 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-04 16:29:24,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2130590434] [2020-09-04 16:29:24,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:24,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:29:24,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347422565] [2020-09-04 16:29:24,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:29:24,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:24,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:29:24,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:29:24,629 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 10 states. [2020-09-04 16:29:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:24,754 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-09-04 16:29:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:29:24,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2020-09-04 16:29:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:24,757 INFO L225 Difference]: With dead ends: 54 [2020-09-04 16:29:24,757 INFO L226 Difference]: Without dead ends: 48 [2020-09-04 16:29:24,759 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:29:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-04 16:29:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-04 16:29:24,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-04 16:29:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-09-04 16:29:24,771 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 56 [2020-09-04 16:29:24,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:24,772 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-09-04 16:29:24,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:29:24,773 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-09-04 16:29:24,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-09-04 16:29:24,774 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:24,775 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:24,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:29:24,775 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:24,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:24,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1000802417, now seen corresponding path program 6 times [2020-09-04 16:29:24,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:24,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1456936532] [2020-09-04 16:29:24,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:24,779 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:24,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-09-04 16:29:25,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1456936532] [2020-09-04 16:29:25,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:25,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:29:25,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643032767] [2020-09-04 16:29:25,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:29:25,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:25,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:29:25,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:29:25,149 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 11 states. [2020-09-04 16:29:25,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:25,270 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-09-04 16:29:25,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:29:25,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2020-09-04 16:29:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:25,272 INFO L225 Difference]: With dead ends: 59 [2020-09-04 16:29:25,272 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 16:29:25,273 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:29:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 16:29:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-09-04 16:29:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-09-04 16:29:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2020-09-04 16:29:25,284 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 64 [2020-09-04 16:29:25,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:25,284 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2020-09-04 16:29:25,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:29:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2020-09-04 16:29:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 16:29:25,286 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:25,286 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:25,287 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:29:25,287 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1977618599, now seen corresponding path program 7 times [2020-09-04 16:29:25,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:25,288 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2075637301] [2020-09-04 16:29:25,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:25,290 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-09-04 16:29:25,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2075637301] [2020-09-04 16:29:25,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:25,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:29:25,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697931054] [2020-09-04 16:29:25,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:29:25,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:25,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:29:25,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:29:25,580 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 12 states. [2020-09-04 16:29:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:25,717 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-09-04 16:29:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:29:25,718 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2020-09-04 16:29:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:25,720 INFO L225 Difference]: With dead ends: 64 [2020-09-04 16:29:25,720 INFO L226 Difference]: Without dead ends: 58 [2020-09-04 16:29:25,721 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:29:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-04 16:29:25,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-09-04 16:29:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 16:29:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2020-09-04 16:29:25,732 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 72 [2020-09-04 16:29:25,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:25,732 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2020-09-04 16:29:25,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:29:25,732 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-09-04 16:29:25,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-09-04 16:29:25,734 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:25,734 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:25,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:29:25,735 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:25,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:25,735 INFO L82 PathProgramCache]: Analyzing trace with hash 555623729, now seen corresponding path program 8 times [2020-09-04 16:29:25,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:25,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [55074360] [2020-09-04 16:29:25,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:25,738 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:25,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,090 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-09-04 16:29:26,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [55074360] [2020-09-04 16:29:26,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:26,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:29:26,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525362462] [2020-09-04 16:29:26,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:29:26,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:26,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:29:26,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:29:26,093 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 13 states. [2020-09-04 16:29:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:26,253 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-09-04 16:29:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:29:26,254 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2020-09-04 16:29:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:26,256 INFO L225 Difference]: With dead ends: 69 [2020-09-04 16:29:26,256 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 16:29:26,257 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:29:26,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 16:29:26,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-09-04 16:29:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-09-04 16:29:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-09-04 16:29:26,268 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 80 [2020-09-04 16:29:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:26,269 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-09-04 16:29:26,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:29:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-09-04 16:29:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-09-04 16:29:26,270 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:26,270 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:26,271 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:29:26,271 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:26,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:26,271 INFO L82 PathProgramCache]: Analyzing trace with hash 777699815, now seen corresponding path program 9 times [2020-09-04 16:29:26,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:26,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [256306517] [2020-09-04 16:29:26,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:26,274 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-09-04 16:29:26,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [256306517] [2020-09-04 16:29:26,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:26,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:29:26,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139648969] [2020-09-04 16:29:26,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:29:26,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:26,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:29:26,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:29:26,708 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 14 states. [2020-09-04 16:29:26,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:26,874 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-09-04 16:29:26,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:29:26,875 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2020-09-04 16:29:26,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:26,876 INFO L225 Difference]: With dead ends: 74 [2020-09-04 16:29:26,877 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 16:29:26,878 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:29:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 16:29:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-09-04 16:29:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-09-04 16:29:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2020-09-04 16:29:26,890 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 88 [2020-09-04 16:29:26,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:26,890 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2020-09-04 16:29:26,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:29:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2020-09-04 16:29:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-09-04 16:29:26,891 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:26,892 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:26,892 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:29:26,892 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:26,893 INFO L82 PathProgramCache]: Analyzing trace with hash 2145915377, now seen corresponding path program 10 times [2020-09-04 16:29:26,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:26,893 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1303188202] [2020-09-04 16:29:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:26,895 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:26,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-09-04 16:29:27,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1303188202] [2020-09-04 16:29:27,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:27,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:29:27,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266253943] [2020-09-04 16:29:27,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:29:27,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:27,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:29:27,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:29:27,441 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 15 states. [2020-09-04 16:29:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:27,646 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-09-04 16:29:27,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 16:29:27,646 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2020-09-04 16:29:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:27,648 INFO L225 Difference]: With dead ends: 79 [2020-09-04 16:29:27,649 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 16:29:27,651 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-09-04 16:29:27,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 16:29:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-09-04 16:29:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-09-04 16:29:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2020-09-04 16:29:27,673 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 96 [2020-09-04 16:29:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:27,675 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2020-09-04 16:29:27,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:29:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2020-09-04 16:29:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-09-04 16:29:27,676 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:27,677 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:27,677 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:29:27,677 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:27,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1180214055, now seen corresponding path program 11 times [2020-09-04 16:29:27,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:27,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1788932703] [2020-09-04 16:29:27,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:27,681 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:27,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-09-04 16:29:28,292 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1788932703] [2020-09-04 16:29:28,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:28,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:29:28,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558919623] [2020-09-04 16:29:28,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:29:28,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:28,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:29:28,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:29:28,295 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 16 states. [2020-09-04 16:29:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:28,519 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-09-04 16:29:28,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:29:28,520 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-09-04 16:29:28,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:28,521 INFO L225 Difference]: With dead ends: 84 [2020-09-04 16:29:28,521 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 16:29:28,525 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:29:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 16:29:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-09-04 16:29:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-04 16:29:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2020-09-04 16:29:28,543 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 104 [2020-09-04 16:29:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:28,544 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2020-09-04 16:29:28,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:29:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2020-09-04 16:29:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-09-04 16:29:28,547 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:28,547 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:28,547 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:29:28,548 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:28,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:28,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1287598415, now seen corresponding path program 12 times [2020-09-04 16:29:28,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:28,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [190000204] [2020-09-04 16:29:28,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:28,555 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:28,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-09-04 16:29:29,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [190000204] [2020-09-04 16:29:29,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:29,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:29:29,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798069188] [2020-09-04 16:29:29,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:29:29,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:29,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:29:29,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:29:29,286 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 17 states. [2020-09-04 16:29:29,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:29,521 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-09-04 16:29:29,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 16:29:29,521 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2020-09-04 16:29:29,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:29,523 INFO L225 Difference]: With dead ends: 89 [2020-09-04 16:29:29,523 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 16:29:29,524 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:29:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 16:29:29,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-09-04 16:29:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-09-04 16:29:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2020-09-04 16:29:29,534 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 112 [2020-09-04 16:29:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:29,534 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2020-09-04 16:29:29,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:29:29,535 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2020-09-04 16:29:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-09-04 16:29:29,536 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:29,536 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:29,537 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:29:29,537 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:29,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:29,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1612559463, now seen corresponding path program 13 times [2020-09-04 16:29:29,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:29,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1558303924] [2020-09-04 16:29:29,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:29,540 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:29,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:30,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:30,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:30,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:30,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-09-04 16:29:30,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1558303924] [2020-09-04 16:29:30,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:30,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 16:29:30,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410557057] [2020-09-04 16:29:30,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 16:29:30,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:30,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 16:29:30,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:29:30,264 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 18 states. [2020-09-04 16:29:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:30,492 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-09-04 16:29:30,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:29:30,493 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 120 [2020-09-04 16:29:30,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:30,494 INFO L225 Difference]: With dead ends: 94 [2020-09-04 16:29:30,494 INFO L226 Difference]: Without dead ends: 88 [2020-09-04 16:29:30,496 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:29:30,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-09-04 16:29:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-09-04 16:29:30,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-09-04 16:29:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2020-09-04 16:29:30,504 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 120 [2020-09-04 16:29:30,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:30,505 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2020-09-04 16:29:30,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 16:29:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2020-09-04 16:29:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 16:29:30,507 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:30,507 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:30,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 16:29:30,507 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:30,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:30,508 INFO L82 PathProgramCache]: Analyzing trace with hash 996432753, now seen corresponding path program 14 times [2020-09-04 16:29:30,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:30,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [969331880] [2020-09-04 16:29:30,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:30,511 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:30,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:29:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:30,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:29:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:30,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:30,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:30,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:30,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:30,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:30,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:30,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:30,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:30,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:31,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:31,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:31,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:31,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:31,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:29:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:29:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-09-04 16:29:31,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [969331880] [2020-09-04 16:29:31,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:29:31,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 16:29:31,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875120680] [2020-09-04 16:29:31,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 16:29:31,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:29:31,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 16:29:31,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:29:31,325 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 19 states. [2020-09-04 16:29:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:29:31,557 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-09-04 16:29:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:29:31,558 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 128 [2020-09-04 16:29:31,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:29:31,559 INFO L225 Difference]: With dead ends: 99 [2020-09-04 16:29:31,560 INFO L226 Difference]: Without dead ends: 93 [2020-09-04 16:29:31,561 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 16:29:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-09-04 16:29:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-09-04 16:29:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-09-04 16:29:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2020-09-04 16:29:31,569 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 128 [2020-09-04 16:29:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:29:31,570 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2020-09-04 16:29:31,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 16:29:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2020-09-04 16:29:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-09-04 16:29:31,572 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:29:31,572 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:29:31,573 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 16:29:31,573 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:29:31,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:29:31,573 INFO L82 PathProgramCache]: Analyzing trace with hash 418248103, now seen corresponding path program 15 times [2020-09-04 16:29:31,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:29:31,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1531211116] [2020-09-04 16:29:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:29:31,576 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:29:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 16:29:31,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 16:29:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 16:29:31,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 16:29:31,664 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 16:29:31,665 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 16:29:31,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 16:29:31,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:29:31 BoogieIcfgContainer [2020-09-04 16:29:31,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:29:31,705 INFO L168 Benchmark]: Toolchain (without parser) took 10230.81 ms. Allocated memory was 142.6 MB in the beginning and 366.0 MB in the end (delta: 223.3 MB). Free memory was 101.5 MB in the beginning and 202.4 MB in the end (delta: -100.9 MB). Peak memory consumption was 122.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:31,706 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 142.6 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:29:31,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.85 ms. Allocated memory is still 142.6 MB. Free memory was 101.3 MB in the beginning and 92.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:31,707 INFO L168 Benchmark]: Boogie Preprocessor took 39.20 ms. Allocated memory is still 142.6 MB. Free memory was 92.1 MB in the beginning and 90.7 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:29:31,708 INFO L168 Benchmark]: RCFGBuilder took 439.11 ms. Allocated memory was 142.6 MB in the beginning and 200.8 MB in the end (delta: 58.2 MB). Free memory was 90.7 MB in the beginning and 168.6 MB in the end (delta: -77.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:31,709 INFO L168 Benchmark]: TraceAbstraction took 9427.23 ms. Allocated memory was 200.8 MB in the beginning and 366.0 MB in the end (delta: 165.2 MB). Free memory was 168.0 MB in the beginning and 202.4 MB in the end (delta: -34.4 MB). Peak memory consumption was 130.7 MB. Max. memory is 7.1 GB. [2020-09-04 16:29:31,712 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 142.6 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 318.85 ms. Allocated memory is still 142.6 MB. Free memory was 101.3 MB in the beginning and 92.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.20 ms. Allocated memory is still 142.6 MB. Free memory was 92.1 MB in the beginning and 90.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 439.11 ms. Allocated memory was 142.6 MB in the beginning and 200.8 MB in the end (delta: 58.2 MB). Free memory was 90.7 MB in the beginning and 168.6 MB in the end (delta: -77.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9427.23 ms. Allocated memory was 200.8 MB in the beginning and 366.0 MB in the end (delta: 165.2 MB). Free memory was 168.0 MB in the beginning and 202.4 MB in the end (delta: -34.4 MB). Peak memory consumption was 130.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 15; [L11] CALL, EXPR id(input) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND TRUE x==0 [L5] return 0; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] int result = id(input); [L12] COND TRUE result == 15 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.2s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 274 SDtfs, 638 SDslu, 1165 SDs, 0 SdLazy, 465 SolverSat, 35 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=93occurred 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...