/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/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 18:33:46,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 18:33:46,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 18:33:46,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 18:33:46,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 18:33:46,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 18:33:46,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 18:33:46,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 18:33:46,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 18:33:46,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 18:33:46,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 18:33:46,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 18:33:46,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 18:33:46,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 18:33:46,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 18:33:46,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 18:33:46,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 18:33:46,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 18:33:46,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 18:33:46,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 18:33:46,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 18:33:46,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 18:33:46,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 18:33:46,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 18:33:46,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 18:33:46,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 18:33:46,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 18:33:46,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 18:33:46,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 18:33:46,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 18:33:46,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 18:33:46,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 18:33:46,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 18:33:46,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 18:33:46,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 18:33:46,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 18:33:46,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 18:33:46,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 18:33:46,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 18:33:46,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 18:33:46,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 18:33:46,944 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 18:33:46,956 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 18:33:46,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 18:33:46,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 18:33:46,958 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 18:33:46,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 18:33:46,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 18:33:46,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 18:33:46,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 18:33:46,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 18:33:46,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 18:33:46,960 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 18:33:46,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 18:33:46,960 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 18:33:46,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 18:33:46,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 18:33:46,962 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 18:33:46,962 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 18:33:46,962 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 18:33:46,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 18:33:46,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 18:33:46,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 18:33:46,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 18:33:46,964 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-08-22 18:33:47,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 18:33:47,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 18:33:47,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 18:33:47,278 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 18:33:47,279 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 18:33:47,279 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-22 18:33:47,347 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e5e59ca/4d76b07a48f84c7ebacb5fa84f6619de/FLAG3af6df238 [2020-08-22 18:33:47,763 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 18:33:47,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-22 18:33:47,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e5e59ca/4d76b07a48f84c7ebacb5fa84f6619de/FLAG3af6df238 [2020-08-22 18:33:48,133 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e5e59ca/4d76b07a48f84c7ebacb5fa84f6619de [2020-08-22 18:33:48,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 18:33:48,143 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 18:33:48,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 18:33:48,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 18:33:48,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 18:33:48,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 06:33:48" (1/1) ... [2020-08-22 18:33:48,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420dfef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:33:48, skipping insertion in model container [2020-08-22 18:33:48,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 06:33:48" (1/1) ... [2020-08-22 18:33:48,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 18:33:48,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 18:33:48,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 18:33:48,339 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 18:33:48,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 18:33:48,363 INFO L208 MainTranslator]: Completed translation [2020-08-22 18:33:48,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:33:48 WrapperNode [2020-08-22 18:33:48,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 18:33:48,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 18:33:48,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 18:33:48,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 18:33:48,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:33:48" (1/1) ... [2020-08-22 18:33:48,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:33:48" (1/1) ... [2020-08-22 18:33:48,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:33:48" (1/1) ... [2020-08-22 18:33:48,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:33:48" (1/1) ... [2020-08-22 18:33:48,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:33:48" (1/1) ... [2020-08-22 18:33:48,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:33:48" (1/1) ... [2020-08-22 18:33:48,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:33:48" (1/1) ... [2020-08-22 18:33:48,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 18:33:48,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 18:33:48,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 18:33:48,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 18:33:48,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:33:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 18:33:48,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 18:33:48,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 18:33:48,531 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-22 18:33:48,531 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 18:33:48,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 18:33:48,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 18:33:48,532 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-22 18:33:48,532 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 18:33:48,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 18:33:48,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 18:33:48,748 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 18:33:48,749 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 18:33:48,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 06:33:48 BoogieIcfgContainer [2020-08-22 18:33:48,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 18:33:48,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 18:33:48,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 18:33:48,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 18:33:48,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 06:33:48" (1/3) ... [2020-08-22 18:33:48,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b01e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 06:33:48, skipping insertion in model container [2020-08-22 18:33:48,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:33:48" (2/3) ... [2020-08-22 18:33:48,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b01e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 06:33:48, skipping insertion in model container [2020-08-22 18:33:48,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 06:33:48" (3/3) ... [2020-08-22 18:33:48,781 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-22 18:33:48,792 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 18:33:48,801 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 18:33:48,815 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 18:33:48,841 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 18:33:48,842 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 18:33:48,842 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-08-22 18:33:48,842 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 18:33:48,842 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 18:33:48,842 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 18:33:48,842 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 18:33:48,842 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 18:33:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-08-22 18:33:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-08-22 18:33:48,868 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:33:48,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:33:48,870 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:33:48,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:33:48,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2064988448, now seen corresponding path program 1 times [2020-08-22 18:33:48,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:33:48,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1274137089] [2020-08-22 18:33:48,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:33:48,948 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:33:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:49,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:33:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:49,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 18:33:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 18:33:49,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1274137089] [2020-08-22 18:33:49,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:33:49,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 18:33:49,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171660707] [2020-08-22 18:33:49,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 18:33:49,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:33:49,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 18:33:49,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 18:33:49,208 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-08-22 18:33:49,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:33:49,365 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-08-22 18:33:49,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 18:33:49,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-08-22 18:33:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:33:49,378 INFO L225 Difference]: With dead ends: 48 [2020-08-22 18:33:49,378 INFO L226 Difference]: Without dead ends: 30 [2020-08-22 18:33:49,382 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 18:33:49,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-22 18:33:49,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-22 18:33:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-22 18:33:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-08-22 18:33:49,427 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2020-08-22 18:33:49,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:33:49,428 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-08-22 18:33:49,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 18:33:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-08-22 18:33:49,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-08-22 18:33:49,431 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:33:49,431 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:33:49,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 18:33:49,432 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:33:49,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:33:49,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1678486471, now seen corresponding path program 1 times [2020-08-22 18:33:49,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:33:49,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [31998220] [2020-08-22 18:33:49,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:33:49,435 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:33:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:49,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:33:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:49,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 18:33:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 18:33:49,531 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [31998220] [2020-08-22 18:33:49,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:33:49,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 18:33:49,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246261293] [2020-08-22 18:33:49,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 18:33:49,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:33:49,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 18:33:49,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 18:33:49,534 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2020-08-22 18:33:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:33:49,608 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-08-22 18:33:49,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 18:33:49,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-08-22 18:33:49,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:33:49,610 INFO L225 Difference]: With dead ends: 38 [2020-08-22 18:33:49,611 INFO L226 Difference]: Without dead ends: 32 [2020-08-22 18:33:49,612 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 18:33:49,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-08-22 18:33:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-08-22 18:33:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-22 18:33:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-08-22 18:33:49,624 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2020-08-22 18:33:49,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:33:49,624 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-08-22 18:33:49,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 18:33:49,625 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-08-22 18:33:49,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-08-22 18:33:49,626 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:33:49,626 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:33:49,627 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 18:33:49,627 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:33:49,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:33:49,628 INFO L82 PathProgramCache]: Analyzing trace with hash 961212118, now seen corresponding path program 1 times [2020-08-22 18:33:49,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:33:49,628 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [416936686] [2020-08-22 18:33:49,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:33:49,631 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:33:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:49,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:33:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:49,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 18:33:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:49,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:49,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:33:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 18:33:49,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [416936686] [2020-08-22 18:33:49,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:33:49,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-22 18:33:49,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629743321] [2020-08-22 18:33:49,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 18:33:49,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:33:49,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 18:33:49,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 18:33:49,770 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-08-22 18:33:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:33:49,861 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2020-08-22 18:33:49,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 18:33:49,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-08-22 18:33:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:33:49,864 INFO L225 Difference]: With dead ends: 54 [2020-08-22 18:33:49,864 INFO L226 Difference]: Without dead ends: 32 [2020-08-22 18:33:49,865 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-22 18:33:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-08-22 18:33:49,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-08-22 18:33:49,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-08-22 18:33:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-08-22 18:33:49,877 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 35 [2020-08-22 18:33:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:33:49,878 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-08-22 18:33:49,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 18:33:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-08-22 18:33:49,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-08-22 18:33:49,880 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:33:49,881 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:33:49,881 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 18:33:49,881 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:33:49,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:33:49,882 INFO L82 PathProgramCache]: Analyzing trace with hash -125795935, now seen corresponding path program 1 times [2020-08-22 18:33:49,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:33:49,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [294042092] [2020-08-22 18:33:49,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:33:49,885 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:33:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:49,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:33:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:49,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 18:33:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:49,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:49,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 18:33:49,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [294042092] [2020-08-22 18:33:49,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:33:49,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-22 18:33:49,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450760055] [2020-08-22 18:33:49,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 18:33:49,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:33:50,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 18:33:50,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 18:33:50,005 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2020-08-22 18:33:50,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:33:50,114 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2020-08-22 18:33:50,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 18:33:50,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-08-22 18:33:50,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:33:50,118 INFO L225 Difference]: With dead ends: 58 [2020-08-22 18:33:50,118 INFO L226 Difference]: Without dead ends: 52 [2020-08-22 18:33:50,119 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 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-08-22 18:33:50,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-08-22 18:33:50,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-08-22 18:33:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-08-22 18:33:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2020-08-22 18:33:50,141 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 36 [2020-08-22 18:33:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:33:50,142 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2020-08-22 18:33:50,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 18:33:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-08-22 18:33:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-08-22 18:33:50,148 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:33:50,148 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:33:50,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 18:33:50,149 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:33:50,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:33:50,149 INFO L82 PathProgramCache]: Analyzing trace with hash 331377205, now seen corresponding path program 2 times [2020-08-22 18:33:50,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:33:50,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [502076563] [2020-08-22 18:33:50,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:33:50,152 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:33:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:33:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 18:33:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-08-22 18:33:50,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [502076563] [2020-08-22 18:33:50,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:33:50,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 18:33:50,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327656808] [2020-08-22 18:33:50,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 18:33:50,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:33:50,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 18:33:50,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 18:33:50,325 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 7 states. [2020-08-22 18:33:50,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:33:50,441 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2020-08-22 18:33:50,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 18:33:50,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2020-08-22 18:33:50,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:33:50,444 INFO L225 Difference]: With dead ends: 110 [2020-08-22 18:33:50,444 INFO L226 Difference]: Without dead ends: 66 [2020-08-22 18:33:50,446 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-22 18:33:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-08-22 18:33:50,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2020-08-22 18:33:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-22 18:33:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2020-08-22 18:33:50,460 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 53 [2020-08-22 18:33:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:33:50,461 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-08-22 18:33:50,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 18:33:50,461 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-08-22 18:33:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-08-22 18:33:50,463 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:33:50,463 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:33:50,464 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 18:33:50,464 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:33:50,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:33:50,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2068833840, now seen corresponding path program 3 times [2020-08-22 18:33:50,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:33:50,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1334335596] [2020-08-22 18:33:50,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:33:50,467 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:33:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:33:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 18:33:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-08-22 18:33:50,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1334335596] [2020-08-22 18:33:50,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:33:50,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 18:33:50,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327284145] [2020-08-22 18:33:50,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 18:33:50,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:33:50,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 18:33:50,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 18:33:50,610 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 7 states. [2020-08-22 18:33:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:33:50,730 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2020-08-22 18:33:50,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 18:33:50,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-08-22 18:33:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:33:50,733 INFO L225 Difference]: With dead ends: 88 [2020-08-22 18:33:50,734 INFO L226 Difference]: Without dead ends: 82 [2020-08-22 18:33:50,735 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 18:33:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-08-22 18:33:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2020-08-22 18:33:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-08-22 18:33:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2020-08-22 18:33:50,753 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 54 [2020-08-22 18:33:50,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:33:50,754 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2020-08-22 18:33:50,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 18:33:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2020-08-22 18:33:50,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-08-22 18:33:50,758 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:33:50,758 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:33:50,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 18:33:50,759 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:33:50,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:33:50,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1575340027, now seen corresponding path program 4 times [2020-08-22 18:33:50,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:33:50,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1367701650] [2020-08-22 18:33:50,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:33:50,762 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:33:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:33:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 18:33:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:33:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:50,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:33:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2020-08-22 18:33:51,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1367701650] [2020-08-22 18:33:51,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:33:51,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 18:33:51,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713061823] [2020-08-22 18:33:51,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 18:33:51,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:33:51,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 18:33:51,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 18:33:51,076 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 10 states. [2020-08-22 18:33:51,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:33:51,349 INFO L93 Difference]: Finished difference Result 139 states and 201 transitions. [2020-08-22 18:33:51,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 18:33:51,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2020-08-22 18:33:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:33:51,353 INFO L225 Difference]: With dead ends: 139 [2020-08-22 18:33:51,353 INFO L226 Difference]: Without dead ends: 70 [2020-08-22 18:33:51,355 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2020-08-22 18:33:51,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-08-22 18:33:51,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2020-08-22 18:33:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-22 18:33:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2020-08-22 18:33:51,367 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 125 [2020-08-22 18:33:51,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:33:51,368 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-08-22 18:33:51,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 18:33:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2020-08-22 18:33:51,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-08-22 18:33:51,369 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:33:51,370 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:33:51,370 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 18:33:51,370 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:33:51,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:33:51,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1005193447, now seen corresponding path program 5 times [2020-08-22 18:33:51,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:33:51,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1666275323] [2020-08-22 18:33:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:33:51,373 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:33:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:33:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 18:33:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:33:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-08-22 18:33:51,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1666275323] [2020-08-22 18:33:51,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:33:51,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 18:33:51,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222633582] [2020-08-22 18:33:51,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 18:33:51,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:33:51,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 18:33:51,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-22 18:33:51,528 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2020-08-22 18:33:51,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:33:51,668 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2020-08-22 18:33:51,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 18:33:51,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-08-22 18:33:51,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:33:51,670 INFO L225 Difference]: With dead ends: 73 [2020-08-22 18:33:51,670 INFO L226 Difference]: Without dead ends: 67 [2020-08-22 18:33:51,671 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-22 18:33:51,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-08-22 18:33:51,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-08-22 18:33:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-08-22 18:33:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2020-08-22 18:33:51,682 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 89 [2020-08-22 18:33:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:33:51,683 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2020-08-22 18:33:51,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 18:33:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2020-08-22 18:33:51,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-08-22 18:33:51,685 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:33:51,686 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:33:51,686 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 18:33:51,686 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:33:51,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:33:51,686 INFO L82 PathProgramCache]: Analyzing trace with hash -750862549, now seen corresponding path program 6 times [2020-08-22 18:33:51,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:33:51,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [678680171] [2020-08-22 18:33:51,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:33:51,689 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:33:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:33:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 18:33:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:33:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 18:33:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:33:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:51,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 18:33:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,045 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2020-08-22 18:33:52,046 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [678680171] [2020-08-22 18:33:52,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:33:52,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 18:33:52,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957538148] [2020-08-22 18:33:52,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 18:33:52,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:33:52,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 18:33:52,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-22 18:33:52,048 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 9 states. [2020-08-22 18:33:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:33:52,240 INFO L93 Difference]: Finished difference Result 169 states and 222 transitions. [2020-08-22 18:33:52,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 18:33:52,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2020-08-22 18:33:52,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:33:52,244 INFO L225 Difference]: With dead ends: 169 [2020-08-22 18:33:52,244 INFO L226 Difference]: Without dead ends: 163 [2020-08-22 18:33:52,245 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-22 18:33:52,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-08-22 18:33:52,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 145. [2020-08-22 18:33:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-08-22 18:33:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 194 transitions. [2020-08-22 18:33:52,273 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 194 transitions. Word has length 195 [2020-08-22 18:33:52,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:33:52,275 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 194 transitions. [2020-08-22 18:33:52,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 18:33:52,275 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 194 transitions. [2020-08-22 18:33:52,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2020-08-22 18:33:52,278 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:33:52,278 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:33:52,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 18:33:52,279 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:33:52,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:33:52,279 INFO L82 PathProgramCache]: Analyzing trace with hash 764562375, now seen corresponding path program 7 times [2020-08-22 18:33:52,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:33:52,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1532604775] [2020-08-22 18:33:52,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:33:52,282 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:33:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:33:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 18:33:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:33:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 18:33:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 18:33:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:33:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 18:33:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 55 proven. 137 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2020-08-22 18:33:52,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1532604775] [2020-08-22 18:33:52,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:33:52,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-22 18:33:52,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901534220] [2020-08-22 18:33:52,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 18:33:52,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:33:52,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 18:33:52,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-08-22 18:33:52,978 INFO L87 Difference]: Start difference. First operand 145 states and 194 transitions. Second operand 14 states. [2020-08-22 18:33:53,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:33:53,597 INFO L93 Difference]: Finished difference Result 251 states and 382 transitions. [2020-08-22 18:33:53,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-08-22 18:33:53,598 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 265 [2020-08-22 18:33:53,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:33:53,601 INFO L225 Difference]: With dead ends: 251 [2020-08-22 18:33:53,601 INFO L226 Difference]: Without dead ends: 116 [2020-08-22 18:33:53,605 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2020-08-22 18:33:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-08-22 18:33:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2020-08-22 18:33:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-08-22 18:33:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2020-08-22 18:33:53,648 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 122 transitions. Word has length 265 [2020-08-22 18:33:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:33:53,649 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 122 transitions. [2020-08-22 18:33:53,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 18:33:53,649 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 122 transitions. [2020-08-22 18:33:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-08-22 18:33:53,653 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:33:53,653 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:33:53,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 18:33:53,654 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:33:53,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:33:53,654 INFO L82 PathProgramCache]: Analyzing trace with hash -753564480, now seen corresponding path program 8 times [2020-08-22 18:33:53,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:33:53,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [158228211] [2020-08-22 18:33:53,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:33:53,662 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:33:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:53,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:33:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:53,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 18:33:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:53,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:53,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:53,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:53,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:33:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 18:33:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 18:33:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:33:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2020-08-22 18:33:54,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [158228211] [2020-08-22 18:33:54,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:33:54,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 18:33:54,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842641066] [2020-08-22 18:33:54,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 18:33:54,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:33:54,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 18:33:54,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 18:33:54,217 INFO L87 Difference]: Start difference. First operand 99 states and 122 transitions. Second operand 10 states. [2020-08-22 18:33:54,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:33:54,414 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2020-08-22 18:33:54,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 18:33:54,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 230 [2020-08-22 18:33:54,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:33:54,418 INFO L225 Difference]: With dead ends: 111 [2020-08-22 18:33:54,418 INFO L226 Difference]: Without dead ends: 105 [2020-08-22 18:33:54,419 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 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-08-22 18:33:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-08-22 18:33:54,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-08-22 18:33:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-08-22 18:33:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2020-08-22 18:33:54,433 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 230 [2020-08-22 18:33:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:33:54,434 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2020-08-22 18:33:54,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 18:33:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2020-08-22 18:33:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2020-08-22 18:33:54,442 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:33:54,442 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:33:54,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 18:33:54,443 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:33:54,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:33:54,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1790891897, now seen corresponding path program 9 times [2020-08-22 18:33:54,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:33:54,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [963293086] [2020-08-22 18:33:54,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:33:54,447 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:33:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:33:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 18:33:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:33:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:54,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 18:33:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-08-22 18:33:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:33:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-08-22 18:33:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 18:33:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-08-22 18:33:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 18:33:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 18:33:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 18:33:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:33:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2020-08-22 18:33:55,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [963293086] [2020-08-22 18:33:55,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:33:55,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 18:33:55,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446113121] [2020-08-22 18:33:55,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 18:33:55,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:33:55,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 18:33:55,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-22 18:33:55,403 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand 11 states. [2020-08-22 18:33:55,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:33:55,686 INFO L93 Difference]: Finished difference Result 352 states and 478 transitions. [2020-08-22 18:33:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 18:33:55,686 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 371 [2020-08-22 18:33:55,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:33:55,691 INFO L225 Difference]: With dead ends: 352 [2020-08-22 18:33:55,691 INFO L226 Difference]: Without dead ends: 346 [2020-08-22 18:33:55,692 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 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-08-22 18:33:55,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-08-22 18:33:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 316. [2020-08-22 18:33:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2020-08-22 18:33:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 433 transitions. [2020-08-22 18:33:55,732 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 433 transitions. Word has length 371 [2020-08-22 18:33:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:33:55,733 INFO L479 AbstractCegarLoop]: Abstraction has 316 states and 433 transitions. [2020-08-22 18:33:55,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 18:33:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 433 transitions. [2020-08-22 18:33:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2020-08-22 18:33:55,746 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:33:55,746 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 21, 21, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:33:55,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 18:33:55,746 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:33:55,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:33:55,747 INFO L82 PathProgramCache]: Analyzing trace with hash -170434367, now seen corresponding path program 10 times [2020-08-22 18:33:55,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:33:55,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [481379740] [2020-08-22 18:33:55,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:33:55,750 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:33:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 18:33:55,878 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 18:33:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 18:33:56,046 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 18:33:56,121 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-22 18:33:56,121 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 18:33:56,123 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 18:33:56,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 06:33:56 BoogieIcfgContainer [2020-08-22 18:33:56,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 18:33:56,208 INFO L168 Benchmark]: Toolchain (without parser) took 8061.35 ms. Allocated memory was 138.9 MB in the beginning and 453.5 MB in the end (delta: 314.6 MB). Free memory was 101.7 MB in the beginning and 358.8 MB in the end (delta: -257.1 MB). Peak memory consumption was 267.5 MB. Max. memory is 7.1 GB. [2020-08-22 18:33:56,210 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-08-22 18:33:56,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.52 ms. Allocated memory is still 138.9 MB. Free memory was 101.3 MB in the beginning and 92.2 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-08-22 18:33:56,211 INFO L168 Benchmark]: Boogie Preprocessor took 98.85 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 92.2 MB in the beginning and 181.5 MB in the end (delta: -89.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-08-22 18:33:56,212 INFO L168 Benchmark]: RCFGBuilder took 290.46 ms. Allocated memory is still 202.4 MB. Free memory was 181.5 MB in the beginning and 168.7 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2020-08-22 18:33:56,218 INFO L168 Benchmark]: TraceAbstraction took 7432.80 ms. Allocated memory was 202.4 MB in the beginning and 453.5 MB in the end (delta: 251.1 MB). Free memory was 168.1 MB in the beginning and 358.8 MB in the end (delta: -190.7 MB). Peak memory consumption was 270.4 MB. Max. memory is 7.1 GB. [2020-08-22 18:33:56,225 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 220.52 ms. Allocated memory is still 138.9 MB. Free memory was 101.3 MB in the beginning and 92.2 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 98.85 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 92.2 MB in the beginning and 181.5 MB in the end (delta: -89.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 290.46 ms. Allocated memory is still 202.4 MB. Free memory was 181.5 MB in the beginning and 168.7 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7432.80 ms. Allocated memory was 202.4 MB in the beginning and 453.5 MB in the end (delta: 251.1 MB). Free memory was 168.1 MB in the beginning and 358.8 MB in the end (delta: -190.7 MB). Peak memory consumption was 270.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.2s, OverallIterations: 13, TraceHistogramMax: 67, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 370 SDtfs, 631 SDslu, 1058 SDs, 0 SdLazy, 1058 SolverSat, 344 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=12, 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, 12 MinimizatonAttempts, 94 StatesRemovedByMinimization, 7 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...