/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:26:56,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:26:56,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:26:56,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:26:56,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:26:56,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:26:56,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:26:56,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:26:56,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:26:56,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:26:56,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:26:56,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:26:56,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:26:56,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:26:56,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:26:56,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:26:56,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:26:56,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:26:56,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:26:56,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:26:56,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:26:56,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:26:56,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:26:56,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:26:56,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:26:56,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:26:56,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:26:56,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:26:56,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:26:56,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:26:56,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:26:56,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:26:56,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:26:56,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:26:56,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:26:56,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:26:56,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:26:56,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:26:56,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:26:56,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:26:56,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:26:56,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 16:26:56,215 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:26:56,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:26:56,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:26:56,219 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:26:56,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:26:56,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:26:56,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:26:56,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:26:56,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:26:56,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:26:56,221 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:26:56,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:26:56,221 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:26:56,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:26:56,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:26:56,222 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:26:56,223 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:26:56,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:26:56,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:26:56,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:26:56,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:26:56,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:26:56,224 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:26:56,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:26:56,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:26:56,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:26:56,791 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:26:56,791 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:26:56,793 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c [2020-09-04 16:26:56,892 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e8427d690/4034eb60432d4a60934692cc813e253d/FLAG5575d6c4a [2020-09-04 16:26:57,578 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:26:57,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-1.c [2020-09-04 16:26:57,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e8427d690/4034eb60432d4a60934692cc813e253d/FLAG5575d6c4a [2020-09-04 16:26:57,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e8427d690/4034eb60432d4a60934692cc813e253d [2020-09-04 16:26:57,920 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:26:57,922 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:26:57,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:26:57,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:26:57,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:26:57,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:26:57" (1/1) ... [2020-09-04 16:26:57,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ba14b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:57, skipping insertion in model container [2020-09-04 16:26:57,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:26:57" (1/1) ... [2020-09-04 16:26:57,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:26:57,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:26:58,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:26:58,196 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:26:58,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:26:58,241 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:26:58,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:58 WrapperNode [2020-09-04 16:26:58,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:26:58,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:26:58,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:26:58,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:26:58,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:58" (1/1) ... [2020-09-04 16:26:58,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:58" (1/1) ... [2020-09-04 16:26:58,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:58" (1/1) ... [2020-09-04 16:26:58,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:58" (1/1) ... [2020-09-04 16:26:58,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:58" (1/1) ... [2020-09-04 16:26:58,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:58" (1/1) ... [2020-09-04 16:26:58,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:58" (1/1) ... [2020-09-04 16:26:58,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:26:58,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:26:58,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:26:58,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:26:58,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:58" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:26:58,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:26:58,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:26:58,473 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-09-04 16:26:58,473 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-09-04 16:26:58,474 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:26:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:26:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:26:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-09-04 16:26:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-09-04 16:26:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:26:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:26:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:26:58,758 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:26:58,759 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:26:58,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:26:58 BoogieIcfgContainer [2020-09-04 16:26:58,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:26:58,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:26:58,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:26:58,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:26:58,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:26:57" (1/3) ... [2020-09-04 16:26:58,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24dac6ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:26:58, skipping insertion in model container [2020-09-04 16:26:58,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:58" (2/3) ... [2020-09-04 16:26:58,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24dac6ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:26:58, skipping insertion in model container [2020-09-04 16:26:58,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:26:58" (3/3) ... [2020-09-04 16:26:58,788 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-1.c [2020-09-04 16:26:58,800 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:26:58,813 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:26:58,839 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:26:58,882 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:26:58,882 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:26:58,883 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:26:58,884 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:26:58,884 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:26:58,884 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:26:58,884 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:26:58,886 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:26:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-09-04 16:26:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 16:26:58,929 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:58,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:58,932 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:58,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:58,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-09-04 16:26:58,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:58,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1026851223] [2020-09-04 16:26:58,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:59,037 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:59,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:59,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:26:59,291 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1026851223] [2020-09-04 16:26:59,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:59,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:26:59,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33536097] [2020-09-04 16:26:59,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:26:59,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:59,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:26:59,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:26:59,335 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-09-04 16:26:59,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:59,581 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-09-04 16:26:59,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:26:59,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 16:26:59,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:59,603 INFO L225 Difference]: With dead ends: 58 [2020-09-04 16:26:59,603 INFO L226 Difference]: Without dead ends: 42 [2020-09-04 16:26:59,609 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:26:59,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-04 16:26:59,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-04 16:26:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 16:26:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 16:26:59,686 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-09-04 16:26:59,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:59,686 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 16:26:59,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:26:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 16:26:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 16:26:59,691 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:59,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:59,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:26:59,692 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:59,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:59,693 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-09-04 16:26:59,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:59,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1727986870] [2020-09-04 16:26:59,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:59,697 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:59,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:59,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:59,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:26:59,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1727986870] [2020-09-04 16:26:59,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:59,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:26:59,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883080063] [2020-09-04 16:26:59,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:26:59,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:59,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:26:59,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:26:59,795 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-09-04 16:26:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:59,894 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-09-04 16:26:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:26:59,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-04 16:26:59,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:59,898 INFO L225 Difference]: With dead ends: 50 [2020-09-04 16:26:59,898 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 16:26:59,901 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:26:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 16:26:59,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-09-04 16:26:59,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 16:26:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 16:26:59,918 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-09-04 16:26:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:59,919 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 16:26:59,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:26:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 16:26:59,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 16:26:59,921 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:59,922 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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-09-04 16:26:59,922 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:26:59,923 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:59,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:59,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-09-04 16:26:59,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:59,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [203851017] [2020-09-04 16:26:59,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:59,929 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:59,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:59,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:00,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:00,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 16:27:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 16:27:00,131 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [203851017] [2020-09-04 16:27:00,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:00,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:27:00,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951098511] [2020-09-04 16:27:00,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:27:00,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:00,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:27:00,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:27:00,138 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-09-04 16:27:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:00,284 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-09-04 16:27:00,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:27:00,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-09-04 16:27:00,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:00,287 INFO L225 Difference]: With dead ends: 82 [2020-09-04 16:27:00,288 INFO L226 Difference]: Without dead ends: 46 [2020-09-04 16:27:00,290 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:27:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-04 16:27:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-09-04 16:27:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-09-04 16:27:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-09-04 16:27:00,310 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-09-04 16:27:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:00,311 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-09-04 16:27:00,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:27:00,311 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-09-04 16:27:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 16:27:00,314 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:00,314 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:00,315 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:27:00,315 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:00,316 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-09-04 16:27:00,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:00,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [396468103] [2020-09-04 16:27:00,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:00,320 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:00,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:00,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:00,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:00,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 16:27:00,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [396468103] [2020-09-04 16:27:00,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:00,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:27:00,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324829555] [2020-09-04 16:27:00,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:27:00,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:00,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:27:00,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:27:00,525 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-09-04 16:27:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:00,755 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-09-04 16:27:00,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:27:00,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-09-04 16:27:00,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:00,760 INFO L225 Difference]: With dead ends: 74 [2020-09-04 16:27:00,760 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 16:27:00,761 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:27:00,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 16:27:00,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-09-04 16:27:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-04 16:27:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-09-04 16:27:00,781 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-09-04 16:27:00,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:00,782 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-09-04 16:27:00,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:27:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-09-04 16:27:00,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 16:27:00,785 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:00,785 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:00,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:27:00,786 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:00,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:00,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-09-04 16:27:00,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:00,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1809036365] [2020-09-04 16:27:00,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:00,812 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:00,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:00,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:00,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:00,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:00,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 16:27:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:01,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 16:27:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 16:27:01,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1809036365] [2020-09-04 16:27:01,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:01,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:27:01,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466412718] [2020-09-04 16:27:01,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:27:01,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:01,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:27:01,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:27:01,014 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-09-04 16:27:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:01,119 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-09-04 16:27:01,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:27:01,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-09-04 16:27:01,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:01,122 INFO L225 Difference]: With dead ends: 130 [2020-09-04 16:27:01,122 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 16:27:01,125 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:27:01,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 16:27:01,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 16:27:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 16:27:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-09-04 16:27:01,144 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-09-04 16:27:01,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:01,145 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-09-04 16:27:01,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:27:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-09-04 16:27:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 16:27:01,149 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:01,149 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:01,149 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:27:01,150 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:01,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:01,150 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-09-04 16:27:01,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:01,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [559684627] [2020-09-04 16:27:01,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:01,158 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:01,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:01,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:01,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:01,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:01,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:01,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-09-04 16:27:01,333 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [559684627] [2020-09-04 16:27:01,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:01,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:27:01,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277543986] [2020-09-04 16:27:01,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:27:01,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:01,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:27:01,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:27:01,336 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-09-04 16:27:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:01,480 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-09-04 16:27:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:27:01,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-04 16:27:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:01,483 INFO L225 Difference]: With dead ends: 142 [2020-09-04 16:27:01,484 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 16:27:01,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:27:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 16:27:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-09-04 16:27:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-09-04 16:27:01,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-09-04 16:27:01,505 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-09-04 16:27:01,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:01,505 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-09-04 16:27:01,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:27:01,506 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-09-04 16:27:01,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 16:27:01,508 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:01,509 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:01,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:27:01,510 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:01,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:01,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-09-04 16:27:01,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:01,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1321563994] [2020-09-04 16:27:01,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:01,517 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:01,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:01,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:01,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:01,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:01,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:01,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 16:27:01,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1321563994] [2020-09-04 16:27:01,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:01,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:27:01,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064785572] [2020-09-04 16:27:01,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:27:01,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:01,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:27:01,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:27:01,690 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-09-04 16:27:01,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:01,942 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-09-04 16:27:01,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:27:01,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-09-04 16:27:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:01,945 INFO L225 Difference]: With dead ends: 118 [2020-09-04 16:27:01,945 INFO L226 Difference]: Without dead ends: 112 [2020-09-04 16:27:01,946 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:27:01,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-04 16:27:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-09-04 16:27:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-09-04 16:27:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-09-04 16:27:01,982 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-09-04 16:27:01,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:01,983 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-09-04 16:27:01,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:27:01,983 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-09-04 16:27:01,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-09-04 16:27:01,988 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:01,989 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:01,989 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:27:01,989 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:01,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:01,992 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-09-04 16:27:01,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:01,993 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [516281045] [2020-09-04 16:27:01,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:02,000 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 16:27:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-09-04 16:27:02,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [516281045] [2020-09-04 16:27:02,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:02,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:27:02,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868004699] [2020-09-04 16:27:02,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:27:02,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:02,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:27:02,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:27:02,270 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-09-04 16:27:02,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:02,452 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-09-04 16:27:02,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:27:02,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-09-04 16:27:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:02,456 INFO L225 Difference]: With dead ends: 227 [2020-09-04 16:27:02,456 INFO L226 Difference]: Without dead ends: 127 [2020-09-04 16:27:02,458 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:27:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-09-04 16:27:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-09-04 16:27:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-09-04 16:27:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-09-04 16:27:02,485 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-09-04 16:27:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:02,486 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-09-04 16:27:02,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:27:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-09-04 16:27:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 16:27:02,488 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:02,489 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:02,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:27:02,489 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:02,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:02,490 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-09-04 16:27:02,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:02,491 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1059564598] [2020-09-04 16:27:02,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:02,502 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 16:27:02,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1059564598] [2020-09-04 16:27:02,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:02,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:27:02,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070826253] [2020-09-04 16:27:02,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:27:02,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:02,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:27:02,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:27:02,711 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-09-04 16:27:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:02,974 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-09-04 16:27:02,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:27:02,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-09-04 16:27:02,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:02,978 INFO L225 Difference]: With dead ends: 257 [2020-09-04 16:27:02,979 INFO L226 Difference]: Without dead ends: 151 [2020-09-04 16:27:02,981 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:27:02,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-09-04 16:27:03,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-09-04 16:27:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-04 16:27:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-09-04 16:27:03,008 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-09-04 16:27:03,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:03,009 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-09-04 16:27:03,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:27:03,009 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-09-04 16:27:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-09-04 16:27:03,012 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:03,012 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:03,013 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:27:03,013 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:03,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:03,014 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-09-04 16:27:03,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:03,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1638813298] [2020-09-04 16:27:03,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:03,021 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:03,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:03,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:03,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:03,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:03,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:03,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:03,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:03,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:03,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:03,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:03,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:03,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 16:27:03,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1638813298] [2020-09-04 16:27:03,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:03,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:27:03,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130434580] [2020-09-04 16:27:03,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:27:03,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:03,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:27:03,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:27:03,353 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-09-04 16:27:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:03,921 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-09-04 16:27:03,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:27:03,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-09-04 16:27:03,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:03,931 INFO L225 Difference]: With dead ends: 265 [2020-09-04 16:27:03,931 INFO L226 Difference]: Without dead ends: 116 [2020-09-04 16:27:03,937 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:27:03,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-09-04 16:27:03,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2020-09-04 16:27:03,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 16:27:03,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2020-09-04 16:27:03,976 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 105 [2020-09-04 16:27:03,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:03,976 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2020-09-04 16:27:03,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:27:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2020-09-04 16:27:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 16:27:03,978 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:03,979 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:03,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:27:03,980 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:03,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:03,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1534580400, now seen corresponding path program 1 times [2020-09-04 16:27:03,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:03,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1156443582] [2020-09-04 16:27:03,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:03,987 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 16:27:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-09-04 16:27:04,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1156443582] [2020-09-04 16:27:04,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:04,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:27:04,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247176351] [2020-09-04 16:27:04,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:27:04,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:04,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:27:04,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:27:04,288 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 10 states. [2020-09-04 16:27:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:04,610 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2020-09-04 16:27:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:27:04,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-09-04 16:27:04,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:04,614 INFO L225 Difference]: With dead ends: 193 [2020-09-04 16:27:04,614 INFO L226 Difference]: Without dead ends: 105 [2020-09-04 16:27:04,616 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:27:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-09-04 16:27:04,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-09-04 16:27:04,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-04 16:27:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2020-09-04 16:27:04,640 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 123 [2020-09-04 16:27:04,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:04,641 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2020-09-04 16:27:04,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:27:04,641 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2020-09-04 16:27:04,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 16:27:04,644 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:04,645 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:04,645 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:27:04,645 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:04,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:04,646 INFO L82 PathProgramCache]: Analyzing trace with hash 822116120, now seen corresponding path program 2 times [2020-09-04 16:27:04,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:04,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [51380672] [2020-09-04 16:27:04,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:04,683 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:04,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:05,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:05,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:05,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:05,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:05,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:05,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:05,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:05,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:05,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 16:27:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:05,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:05,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-09-04 16:27:05,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [51380672] [2020-09-04 16:27:05,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:05,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:27:05,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947760097] [2020-09-04 16:27:05,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:27:05,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:05,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:27:05,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:27:05,233 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand 12 states. [2020-09-04 16:27:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:05,747 INFO L93 Difference]: Finished difference Result 241 states and 326 transitions. [2020-09-04 16:27:05,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 16:27:05,748 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2020-09-04 16:27:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:05,751 INFO L225 Difference]: With dead ends: 241 [2020-09-04 16:27:05,751 INFO L226 Difference]: Without dead ends: 141 [2020-09-04 16:27:05,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:27:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-09-04 16:27:05,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2020-09-04 16:27:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-04 16:27:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2020-09-04 16:27:05,775 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 140 [2020-09-04 16:27:05,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:05,776 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-09-04 16:27:05,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:27:05,776 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2020-09-04 16:27:05,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 16:27:05,778 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:05,779 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:05,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:27:05,779 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:05,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:05,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1260071360, now seen corresponding path program 2 times [2020-09-04 16:27:05,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:05,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2004752704] [2020-09-04 16:27:05,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:05,787 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:05,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:05,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:05,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:05,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:27:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-09-04 16:27:06,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2004752704] [2020-09-04 16:27:06,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:06,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:27:06,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708297225] [2020-09-04 16:27:06,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:27:06,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:06,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:27:06,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:27:06,167 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 10 states. [2020-09-04 16:27:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:06,492 INFO L93 Difference]: Finished difference Result 244 states and 326 transitions. [2020-09-04 16:27:06,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:27:06,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2020-09-04 16:27:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:06,498 INFO L225 Difference]: With dead ends: 244 [2020-09-04 16:27:06,498 INFO L226 Difference]: Without dead ends: 238 [2020-09-04 16:27:06,500 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:27:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-09-04 16:27:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 213. [2020-09-04 16:27:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-09-04 16:27:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 287 transitions. [2020-09-04 16:27:06,543 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 287 transitions. Word has length 140 [2020-09-04 16:27:06,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:06,543 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 287 transitions. [2020-09-04 16:27:06,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:27:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 287 transitions. [2020-09-04 16:27:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-09-04 16:27:06,548 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:06,549 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:06,549 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:27:06,550 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:06,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:06,550 INFO L82 PathProgramCache]: Analyzing trace with hash -88380307, now seen corresponding path program 3 times [2020-09-04 16:27:06,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:06,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2113808603] [2020-09-04 16:27:06,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:06,558 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:27:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:06,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:07,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:07,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:07,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:07,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 16:27:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:07,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:07,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:07,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:07,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 21 proven. 35 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-09-04 16:27:07,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2113808603] [2020-09-04 16:27:07,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:07,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:27:07,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330372027] [2020-09-04 16:27:07,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:27:07,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:07,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:27:07,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:27:07,256 INFO L87 Difference]: Start difference. First operand 213 states and 287 transitions. Second operand 14 states. [2020-09-04 16:27:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:07,965 INFO L93 Difference]: Finished difference Result 470 states and 677 transitions. [2020-09-04 16:27:07,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 16:27:07,966 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 193 [2020-09-04 16:27:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:07,972 INFO L225 Difference]: With dead ends: 470 [2020-09-04 16:27:07,972 INFO L226 Difference]: Without dead ends: 257 [2020-09-04 16:27:07,977 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2020-09-04 16:27:07,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-09-04 16:27:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 233. [2020-09-04 16:27:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-09-04 16:27:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 310 transitions. [2020-09-04 16:27:08,052 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 310 transitions. Word has length 193 [2020-09-04 16:27:08,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:08,053 INFO L479 AbstractCegarLoop]: Abstraction has 233 states and 310 transitions. [2020-09-04 16:27:08,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:27:08,053 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 310 transitions. [2020-09-04 16:27:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2020-09-04 16:27:08,061 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:08,062 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 17, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:08,062 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 16:27:08,063 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:08,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:08,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1293350858, now seen corresponding path program 4 times [2020-09-04 16:27:08,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:08,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1585575760] [2020-09-04 16:27:08,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:08,072 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:27:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2020-09-04 16:27:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:27:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:08,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 1 proven. 206 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2020-09-04 16:27:09,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1585575760] [2020-09-04 16:27:09,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:09,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:27:09,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885239166] [2020-09-04 16:27:09,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:27:09,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:09,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:27:09,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:27:09,064 INFO L87 Difference]: Start difference. First operand 233 states and 310 transitions. Second operand 14 states. [2020-09-04 16:27:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:09,795 INFO L93 Difference]: Finished difference Result 534 states and 785 transitions. [2020-09-04 16:27:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 16:27:09,796 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 351 [2020-09-04 16:27:09,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:09,803 INFO L225 Difference]: With dead ends: 534 [2020-09-04 16:27:09,803 INFO L226 Difference]: Without dead ends: 301 [2020-09-04 16:27:09,809 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:27:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2020-09-04 16:27:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 265. [2020-09-04 16:27:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-09-04 16:27:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 352 transitions. [2020-09-04 16:27:09,856 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 352 transitions. Word has length 351 [2020-09-04 16:27:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:09,856 INFO L479 AbstractCegarLoop]: Abstraction has 265 states and 352 transitions. [2020-09-04 16:27:09,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:27:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 352 transitions. [2020-09-04 16:27:09,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-09-04 16:27:09,863 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:09,864 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:09,864 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 16:27:09,865 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:09,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:09,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2113087688, now seen corresponding path program 5 times [2020-09-04 16:27:09,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:09,866 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [380594845] [2020-09-04 16:27:09,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:09,873 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:27:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 16:27:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:27:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 1 proven. 50 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2020-09-04 16:27:10,861 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [380594845] [2020-09-04 16:27:10,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:10,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:27:10,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327424972] [2020-09-04 16:27:10,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:27:10,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:10,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:27:10,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:27:10,864 INFO L87 Difference]: Start difference. First operand 265 states and 352 transitions. Second operand 16 states. [2020-09-04 16:27:11,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:11,767 INFO L93 Difference]: Finished difference Result 487 states and 692 transitions. [2020-09-04 16:27:11,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-09-04 16:27:11,768 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 281 [2020-09-04 16:27:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:11,775 INFO L225 Difference]: With dead ends: 487 [2020-09-04 16:27:11,775 INFO L226 Difference]: Without dead ends: 190 [2020-09-04 16:27:11,779 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 16:27:11,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-09-04 16:27:11,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2020-09-04 16:27:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-09-04 16:27:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 209 transitions. [2020-09-04 16:27:11,801 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 209 transitions. Word has length 281 [2020-09-04 16:27:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:11,802 INFO L479 AbstractCegarLoop]: Abstraction has 163 states and 209 transitions. [2020-09-04 16:27:11,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:27:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 209 transitions. [2020-09-04 16:27:11,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-09-04 16:27:11,805 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:11,806 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:11,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 16:27:11,806 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:11,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:11,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1117162661, now seen corresponding path program 6 times [2020-09-04 16:27:11,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:11,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [568813514] [2020-09-04 16:27:11,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:11,814 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:11,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:11,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:27:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 16:27:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:12,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:13,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:13,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2020-09-04 16:27:13,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [568813514] [2020-09-04 16:27:13,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:13,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2020-09-04 16:27:13,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210474831] [2020-09-04 16:27:13,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-09-04 16:27:13,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:13,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-09-04 16:27:13,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:27:13,304 INFO L87 Difference]: Start difference. First operand 163 states and 209 transitions. Second operand 28 states. [2020-09-04 16:27:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:14,783 INFO L93 Difference]: Finished difference Result 175 states and 223 transitions. [2020-09-04 16:27:14,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-09-04 16:27:14,784 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 228 [2020-09-04 16:27:14,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:14,787 INFO L225 Difference]: With dead ends: 175 [2020-09-04 16:27:14,787 INFO L226 Difference]: Without dead ends: 169 [2020-09-04 16:27:14,789 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=137, Invalid=1843, Unknown=0, NotChecked=0, Total=1980 [2020-09-04 16:27:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-09-04 16:27:14,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2020-09-04 16:27:14,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-09-04 16:27:14,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 208 transitions. [2020-09-04 16:27:14,810 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 208 transitions. Word has length 228 [2020-09-04 16:27:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:14,811 INFO L479 AbstractCegarLoop]: Abstraction has 163 states and 208 transitions. [2020-09-04 16:27:14,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-09-04 16:27:14,811 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 208 transitions. [2020-09-04 16:27:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2020-09-04 16:27:14,818 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:14,818 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 20, 20, 17, 17, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 6, 6, 6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:14,819 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 16:27:14,819 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:14,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:14,820 INFO L82 PathProgramCache]: Analyzing trace with hash -914287645, now seen corresponding path program 7 times [2020-09-04 16:27:14,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:14,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1268806548] [2020-09-04 16:27:14,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:14,826 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:14,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:14,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:27:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-09-04 16:27:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:27:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2020-09-04 16:27:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:27:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:15,696 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 11 proven. 101 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2020-09-04 16:27:15,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1268806548] [2020-09-04 16:27:15,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:15,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:27:15,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088222799] [2020-09-04 16:27:15,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:27:15,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:15,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:27:15,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:27:15,698 INFO L87 Difference]: Start difference. First operand 163 states and 208 transitions. Second operand 11 states. [2020-09-04 16:27:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:16,023 INFO L93 Difference]: Finished difference Result 316 states and 416 transitions. [2020-09-04 16:27:16,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:27:16,023 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 386 [2020-09-04 16:27:16,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:16,026 INFO L225 Difference]: With dead ends: 316 [2020-09-04 16:27:16,027 INFO L226 Difference]: Without dead ends: 162 [2020-09-04 16:27:16,029 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:27:16,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-09-04 16:27:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2020-09-04 16:27:16,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-09-04 16:27:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 201 transitions. [2020-09-04 16:27:16,050 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 201 transitions. Word has length 386 [2020-09-04 16:27:16,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:16,051 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 201 transitions. [2020-09-04 16:27:16,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:27:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 201 transitions. [2020-09-04 16:27:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2020-09-04 16:27:16,059 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:16,060 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 19, 19, 17, 16, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:16,060 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 16:27:16,060 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:16,061 INFO L82 PathProgramCache]: Analyzing trace with hash 120199642, now seen corresponding path program 8 times [2020-09-04 16:27:16,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:16,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [394666802] [2020-09-04 16:27:16,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:16,116 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:27:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 16:27:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:27:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:16,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:17,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2020-09-04 16:27:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:17,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:17,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:17,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:17,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:17,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:17,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:17,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:17,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 3 proven. 127 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2020-09-04 16:27:17,263 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [394666802] [2020-09-04 16:27:17,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:17,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:27:17,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067674807] [2020-09-04 16:27:17,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:27:17,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:17,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:27:17,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:27:17,265 INFO L87 Difference]: Start difference. First operand 159 states and 201 transitions. Second operand 17 states. [2020-09-04 16:27:18,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:18,117 INFO L93 Difference]: Finished difference Result 363 states and 511 transitions. [2020-09-04 16:27:18,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-09-04 16:27:18,119 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 369 [2020-09-04 16:27:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:18,127 INFO L225 Difference]: With dead ends: 363 [2020-09-04 16:27:18,128 INFO L226 Difference]: Without dead ends: 205 [2020-09-04 16:27:18,134 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 16:27:18,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-09-04 16:27:18,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 171. [2020-09-04 16:27:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-09-04 16:27:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 215 transitions. [2020-09-04 16:27:18,163 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 215 transitions. Word has length 369 [2020-09-04 16:27:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:18,164 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 215 transitions. [2020-09-04 16:27:18,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:27:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 215 transitions. [2020-09-04 16:27:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2020-09-04 16:27:18,174 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:18,175 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 15, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:18,175 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 16:27:18,175 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:18,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:18,176 INFO L82 PathProgramCache]: Analyzing trace with hash 689403166, now seen corresponding path program 9 times [2020-09-04 16:27:18,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:18,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1215611521] [2020-09-04 16:27:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:18,213 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:27:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 16:27:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-09-04 16:27:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:27:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:18,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:19,089 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 11 proven. 94 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2020-09-04 16:27:19,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1215611521] [2020-09-04 16:27:19,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:19,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:27:19,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724265400] [2020-09-04 16:27:19,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:27:19,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:19,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:27:19,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:27:19,093 INFO L87 Difference]: Start difference. First operand 171 states and 215 transitions. Second operand 14 states. [2020-09-04 16:27:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:19,600 INFO L93 Difference]: Finished difference Result 345 states and 448 transitions. [2020-09-04 16:27:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 16:27:19,601 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 334 [2020-09-04 16:27:19,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:19,605 INFO L225 Difference]: With dead ends: 345 [2020-09-04 16:27:19,605 INFO L226 Difference]: Without dead ends: 184 [2020-09-04 16:27:19,607 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2020-09-04 16:27:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-09-04 16:27:19,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 174. [2020-09-04 16:27:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-09-04 16:27:19,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 215 transitions. [2020-09-04 16:27:19,633 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 215 transitions. Word has length 334 [2020-09-04 16:27:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:19,633 INFO L479 AbstractCegarLoop]: Abstraction has 174 states and 215 transitions. [2020-09-04 16:27:19,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:27:19,634 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 215 transitions. [2020-09-04 16:27:19,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2020-09-04 16:27:19,640 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:27:19,641 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:27:19,641 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 16:27:19,642 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:27:19,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:27:19,642 INFO L82 PathProgramCache]: Analyzing trace with hash 549243331, now seen corresponding path program 10 times [2020-09-04 16:27:19,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:27:19,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [790636970] [2020-09-04 16:27:19,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:27:19,664 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:27:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:19,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:27:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:19,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:27:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:19,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:27:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 16:27:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-09-04 16:27:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:27:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:27:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:27:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:27:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:27:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:27:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 1 proven. 56 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2020-09-04 16:27:20,596 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [790636970] [2020-09-04 16:27:20,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:27:20,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:27:20,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525182609] [2020-09-04 16:27:20,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:27:20,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:27:20,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:27:20,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:27:20,598 INFO L87 Difference]: Start difference. First operand 174 states and 215 transitions. Second operand 12 states. [2020-09-04 16:27:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:27:21,056 INFO L93 Difference]: Finished difference Result 201 states and 253 transitions. [2020-09-04 16:27:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 16:27:21,057 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 369 [2020-09-04 16:27:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:27:21,058 INFO L225 Difference]: With dead ends: 201 [2020-09-04 16:27:21,058 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:27:21,060 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:27:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:27:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:27:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:27:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:27:21,061 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 369 [2020-09-04 16:27:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:27:21,062 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:27:21,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:27:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:27:21,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:27:21,062 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 16:27:21,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:27:49,447 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 6 [2020-09-04 16:27:50,230 WARN L193 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 42 [2020-09-04 16:27:50,660 WARN L193 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 27 [2020-09-04 16:27:50,834 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 6 [2020-09-04 16:27:51,277 WARN L193 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 27 [2020-09-04 16:27:51,388 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 10 [2020-09-04 16:27:52,741 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 183 DAG size of output: 36 [2020-09-04 16:27:53,267 WARN L193 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 35 [2020-09-04 16:27:54,108 WARN L193 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 42 [2020-09-04 16:27:54,742 WARN L193 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 43 [2020-09-04 16:27:54,852 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 3 [2020-09-04 16:27:54,971 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 6 [2020-09-04 16:27:55,609 WARN L193 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 43 [2020-09-04 16:27:56,408 WARN L193 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 51 [2020-09-04 16:27:57,032 WARN L193 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 35 [2020-09-04 16:27:57,664 WARN L193 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 35 [2020-09-04 16:27:57,777 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 6 [2020-09-04 16:27:57,959 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 7 [2020-09-04 16:27:58,426 WARN L193 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 23 [2020-09-04 16:27:59,772 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 183 DAG size of output: 36 [2020-09-04 16:28:00,227 WARN L193 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 23 [2020-09-04 16:28:00,362 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 8 [2020-09-04 16:28:01,148 WARN L193 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 42 [2020-09-04 16:28:01,283 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 6 [2020-09-04 16:28:01,841 WARN L193 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 26 [2020-09-04 16:28:01,948 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 3 [2020-09-04 16:28:01,956 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:28:01,956 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:28:01,956 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:28:01,956 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:28:01,956 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:28:01,956 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:28:01,957 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false [2020-09-04 16:28:01,957 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-09-04 16:28:01,957 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 35 42) the Hoare annotation is: (<= 6 main_~x~0) [2020-09-04 16:28:01,957 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 35 42) the Hoare annotation is: (<= 6 main_~x~0) [2020-09-04 16:28:01,957 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false [2020-09-04 16:28:01,957 INFO L264 CegarLoopResult]: At program point L38(lines 38 40) the Hoare annotation is: (and (<= 6 main_~x~0) (<= main_~x~0 6) (<= 8 main_~result~0) (<= main_~result~0 8)) [2020-09-04 16:28:01,958 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 6 main_~x~0) (<= main_~x~0 6)) [2020-09-04 16:28:01,958 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 8 |main_#t~ret4|) (<= 6 main_~x~0) (<= |main_#t~ret4| 8) (<= main_~x~0 6)) [2020-09-04 16:28:01,958 INFO L264 CegarLoopResult]: At program point L38-2(lines 38 40) the Hoare annotation is: (<= 6 main_~x~0) [2020-09-04 16:28:01,958 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= 8 |main_#t~ret4|) (<= 6 main_~x~0) (<= |main_#t~ret4| 8) (<= main_~x~0 6)) [2020-09-04 16:28:01,958 INFO L264 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (and (<= 8 |main_#t~ret4|) (<= 6 main_~x~0) (<= |main_#t~ret4| 8) (<= main_~x~0 6) (<= 8 main_~result~0) (<= main_~result~0 8)) [2020-09-04 16:28:01,958 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-09-04 16:28:01,959 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= 2 |fibo2_#in~n|)) [2020-09-04 16:28:01,959 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 3 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 3) .cse0 (<= 5 |fibo2_#in~n|)) (and (<= |fibo2_#t~ret2| 1) .cse0 (<= 1 |fibo2_#t~ret2|) (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)) (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= 4 |fibo2_#in~n|) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2) .cse0 (<= fibo2_~n 4)))) [2020-09-04 16:28:01,959 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= 2 |fibo2_#in~n|)) (< 0 fibo2_~n)) [2020-09-04 16:28:01,959 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 3 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 3) .cse0 (<= 5 |fibo2_#in~n|)) (and (<= |fibo2_#t~ret2| 1) .cse0 (<= 1 |fibo2_#t~ret2|) (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)) (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= 4 |fibo2_#in~n|) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2) .cse0 (<= fibo2_~n 4)))) [2020-09-04 16:28:01,959 INFO L264 CegarLoopResult]: At program point L20(lines 20 24) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 0 fibo2_~n)) [2020-09-04 16:28:01,959 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse5 (<= |fibo2_#in~n| 4)) (.cse6 (<= |fibo2_#t~ret2| 1)) (.cse1 (= fibo2_~n |fibo2_#in~n|)) (.cse7 (<= 1 |fibo2_#t~ret2|)) (.cse3 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|))) (let ((.cse0 (and (<= |fibo2_#in~n| 3) (<= .cse3 2) (<= 3 fibo2_~n) .cse6 .cse1 .cse7 (<= 2 .cse3))) (.cse2 (and (<= 4 |fibo2_#in~n|) (<= .cse3 3) (<= 2 |fibo2_#t~ret2|) .cse5 (<= |fibo2_#t~ret2| 2) .cse1 (<= 3 .cse3))) (.cse4 (and (<= 1 .cse3) (<= .cse3 1) .cse6 .cse1 .cse7 (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)))) (and (or .cse0 (and .cse1 (<= 6 |fibo2_#in~n|)) .cse2 (and (<= 3 |fibo2_#t~ret2|) (<= .cse3 5) (<= |fibo2_#t~ret2| 3) (<= 5 .cse3) .cse1) .cse4) (or (not .cse5) .cse0 .cse2 .cse4)))) [2020-09-04 16:28:01,960 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-09-04 16:28:01,960 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse5 (<= |fibo2_#in~n| 4)) (.cse6 (<= |fibo2_#t~ret2| 1)) (.cse1 (= fibo2_~n |fibo2_#in~n|)) (.cse7 (<= 1 |fibo2_#t~ret2|)) (.cse3 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|))) (let ((.cse0 (and (<= |fibo2_#in~n| 3) (<= .cse3 2) (<= 3 fibo2_~n) .cse6 .cse1 .cse7 (<= 2 .cse3))) (.cse2 (and (<= 4 |fibo2_#in~n|) (<= .cse3 3) (<= 2 |fibo2_#t~ret2|) .cse5 (<= |fibo2_#t~ret2| 2) .cse1 (<= 3 .cse3))) (.cse4 (and (<= 1 .cse3) (<= .cse3 1) .cse6 .cse1 .cse7 (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)))) (and (or .cse0 (and .cse1 (<= 6 |fibo2_#in~n|)) .cse2 (and (<= 3 |fibo2_#t~ret2|) (<= .cse3 5) (<= |fibo2_#t~ret2| 3) (<= 5 .cse3) .cse1) .cse4) (or (not .cse5) .cse0 .cse2 .cse4)))) [2020-09-04 16:28:01,960 INFO L264 CegarLoopResult]: At program point L18(lines 18 24) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-09-04 16:28:01,960 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (let ((.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse1 (<= |fibo2_#t~ret2| 1)) (.cse4 (= fibo2_~n |fibo2_#in~n|)) (.cse2 (<= 1 |fibo2_#t~ret2|))) (let ((.cse3 (and (<= 1 .cse0) (<= .cse0 1) (<= 1 |fibo2_#res|) .cse1 (<= |fibo2_#res| 1) .cse4 .cse2 (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)))) (and (or (and (<= |fibo2_#in~n| 3) (<= .cse0 2) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) .cse1 .cse2 (<= 2 .cse0)) .cse3 (and (<= 3 |fibo2_#t~ret2|) (<= |fibo2_#res| 5) (<= .cse0 5) (<= |fibo2_#t~ret2| 3) (<= 5 .cse0) (<= 5 |fibo2_#in~n|) (<= 5 |fibo2_#res|)) (<= 6 |fibo2_#in~n|) (and (<= 4 |fibo2_#in~n|) (<= .cse0 3) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 4) (<= 3 |fibo2_#res|) (<= |fibo2_#t~ret2| 2) (<= |fibo2_#res| 3) (<= 3 .cse0))) (or .cse3 (and (<= 3 fibo2_~n) .cse4))))) [2020-09-04 16:28:01,961 INFO L264 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (let ((.cse0 (<= |fibo2_#in~n| 4)) (.cse1 (= fibo2_~n |fibo2_#in~n|))) (let ((.cse2 (and (<= 4 fibo2_~n) .cse0 (<= |fibo2_#res| 3) .cse1 (<= 3 |fibo2_#res|)))) (and (or (not .cse0) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse1 (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)) (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n) .cse1) .cse2) (or (not (<= 4 |fibo2_#in~n|)) (and (<= |fibo2_#res| 5) .cse1 (<= 5 |fibo2_#res|)) (and .cse1 (<= 6 |fibo2_#in~n|)) .cse2)))) [2020-09-04 16:28:01,961 INFO L264 CegarLoopResult]: At program point fibo2FINAL(lines 17 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|)) (.cse1 (<= |fibo2_#in~n| 2))) (and (or (and .cse0 (<= |fibo2_#in~n| 0)) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1)) (not .cse1)) (or (and .cse0 (< 0 fibo2_~n)) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))) (or (and (<= 4 fibo2_~n) (<= |fibo2_#in~n| 4) (<= |fibo2_#res| 3) (<= 3 |fibo2_#res|)) (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= |fibo2_#res| 5) (<= 5 |fibo2_#in~n|) (<= 5 |fibo2_#res|)) (and (<= |fibo2_#in~n| 3) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|)) .cse1))) [2020-09-04 16:28:01,961 INFO L264 CegarLoopResult]: At program point fibo2EXIT(lines 17 25) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|)) (.cse1 (<= |fibo2_#in~n| 2))) (and (or (and .cse0 (<= |fibo2_#in~n| 0)) (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1)) (not .cse1)) (or (and .cse0 (< 0 fibo2_~n)) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))) (or (and (<= 4 fibo2_~n) (<= |fibo2_#in~n| 4) (<= |fibo2_#res| 3) (<= 3 |fibo2_#res|)) (and .cse0 (<= 6 |fibo2_#in~n|)) (and (<= |fibo2_#res| 5) (<= 5 |fibo2_#in~n|) (<= 5 |fibo2_#res|)) (and (<= |fibo2_#in~n| 3) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|)) .cse1))) [2020-09-04 16:28:01,961 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-09-04 16:28:01,961 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 2)) (= fibo1_~n |fibo1_#in~n|)) [2020-09-04 16:28:01,961 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 5) (<= 5 fibo1_~n) .cse0) (and (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) .cse0 (<= 3 |fibo1_#in~n|)) (and (<= 5 |fibo1_#in~n|) (<= 5 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 5) .cse0) (and (<= 7 |fibo1_#in~n|) .cse0))) [2020-09-04 16:28:01,962 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-09-04 16:28:01,962 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 5) (<= 5 fibo1_~n) .cse0) (and (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) .cse0 (<= 3 |fibo1_#in~n|)) (and (<= 5 |fibo1_#in~n|) (<= 5 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 5) .cse0) (and (<= 7 |fibo1_#in~n|) .cse0))) [2020-09-04 16:28:01,962 INFO L264 CegarLoopResult]: At program point fibo1FINAL(lines 7 15) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (or (and (<= |fibo1_#in~n| 1) (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (<= |fibo1_#in~n| 0) (<= 7 |fibo1_#in~n|) (and (<= |fibo1_#in~n| 3) (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2) (<= 3 |fibo1_#in~n|)) (and (<= 5 fibo1_~n) (or (<= |fibo1_#in~n| 5) (and (<= 8 |fibo1_#res|) (<= |fibo1_#res| 8))))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-09-04 16:28:01,962 INFO L264 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-09-04 16:28:01,962 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (or (not (<= |fibo1_#in~n| 4)) (and (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1) (<= .cse0 2) (<= 1 |fibo1_#t~ret0|) (<= 2 .cse0))) (not (<= |fibo1_#in~n| 2)) (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 5 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 5) .cse1 (<= 8 .cse0) (<= .cse0 8)) (and (<= |fibo1_#in~n| 5) .cse1) (and (<= 7 |fibo1_#in~n|) .cse1))))) [2020-09-04 16:28:01,962 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-09-04 16:28:01,963 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (let ((.cse0 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (or (not (<= |fibo1_#in~n| 4)) (and (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1) (<= .cse0 2) (<= 1 |fibo1_#t~ret0|) (<= 2 .cse0))) (not (<= |fibo1_#in~n| 2)) (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 5 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 5) .cse1 (<= 8 .cse0) (<= .cse0 8)) (and (<= |fibo1_#in~n| 5) .cse1) (and (<= 7 |fibo1_#in~n|) .cse1))))) [2020-09-04 16:28:01,963 INFO L264 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-09-04 16:28:01,963 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse0 (<= |fibo1_#in~n| 3)) (.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (not (<= |fibo1_#in~n| 2)) (or .cse0 (not (<= |fibo1_#in~n| 4))) (or (and (<= 2 |fibo1_#res|) (<= |fibo1_#t~ret0| 1) (<= .cse1 2) (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#res| 2) (<= 2 .cse1)) (not .cse0)) (let ((.cse2 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 5) .cse2) (and (<= 8 |fibo1_#res|) (<= |fibo1_#res| 8) (<= 5 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 5) .cse2 (<= 8 .cse1) (<= .cse1 8)) (and (<= 7 |fibo1_#in~n|) .cse2))))) [2020-09-04 16:28:01,963 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 5 fibo1_~n) .cse0 (or (<= |fibo1_#in~n| 5) (and (<= 8 |fibo1_#res|) (<= |fibo1_#res| 8)))) (and (<= |fibo1_#in~n| 3) (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2) .cse0) (and (<= 7 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-09-04 16:28:01,963 INFO L264 CegarLoopResult]: At program point fibo1EXIT(lines 7 15) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (or (and (<= |fibo1_#in~n| 1) (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (<= |fibo1_#in~n| 0) (<= 7 |fibo1_#in~n|) (and (<= |fibo1_#in~n| 3) (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2) (<= 3 |fibo1_#in~n|)) (and (<= 5 fibo1_~n) (or (<= |fibo1_#in~n| 5) (and (<= 8 |fibo1_#res|) (<= |fibo1_#res| 8))))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-09-04 16:28:01,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:28:01 BoogieIcfgContainer [2020-09-04 16:28:01,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:28:01,993 INFO L168 Benchmark]: Toolchain (without parser) took 64071.99 ms. Allocated memory was 137.4 MB in the beginning and 845.2 MB in the end (delta: 707.8 MB). Free memory was 101.2 MB in the beginning and 95.2 MB in the end (delta: 6.0 MB). Peak memory consumption was 732.8 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:01,994 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 137.4 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 16:28:01,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.63 ms. Allocated memory is still 137.4 MB. Free memory was 101.0 MB in the beginning and 91.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:01,995 INFO L168 Benchmark]: Boogie Preprocessor took 34.13 ms. Allocated memory is still 137.4 MB. Free memory was 91.3 MB in the beginning and 90.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:01,996 INFO L168 Benchmark]: RCFGBuilder took 491.20 ms. Allocated memory was 137.4 MB in the beginning and 199.2 MB in the end (delta: 61.9 MB). Free memory was 90.0 MB in the beginning and 164.6 MB in the end (delta: -74.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:01,996 INFO L168 Benchmark]: TraceAbstraction took 63220.38 ms. Allocated memory was 199.2 MB in the beginning and 845.2 MB in the end (delta: 645.9 MB). Free memory was 163.9 MB in the beginning and 95.2 MB in the end (delta: 68.7 MB). Peak memory consumption was 733.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:01,999 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.36 ms. Allocated memory is still 137.4 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 319.63 ms. Allocated memory is still 137.4 MB. Free memory was 101.0 MB in the beginning and 91.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.13 ms. Allocated memory is still 137.4 MB. Free memory was 91.3 MB in the beginning and 90.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 491.20 ms. Allocated memory was 137.4 MB in the beginning and 199.2 MB in the end (delta: 61.9 MB). Free memory was 90.0 MB in the beginning and 164.6 MB in the end (delta: -74.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63220.38 ms. Allocated memory was 199.2 MB in the beginning and 845.2 MB in the end (delta: 645.9 MB). Free memory was 163.9 MB in the beginning and 95.2 MB in the end (delta: 68.7 MB). Peak memory consumption was 733.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 35]: Procedure Contract for main Derived contract for procedure main: 6 <= x - ProcedureContractResult [Line: 17]: Procedure Contract for fibo2 Derived contract for procedure fibo2: ((((n == \old(n) && \old(n) <= 0) || (1 <= \result && \result <= 1)) || !(\old(n) <= 2)) && ((n == \old(n) && 0 < n) || (\result <= 0 && 0 <= \result))) && (((((((4 <= n && \old(n) <= 4) && \result <= 3) && 3 <= \result) || (n == \old(n) && 6 <= \old(n))) || ((\result <= 5 && 5 <= \old(n)) && 5 <= \result)) || ((\old(n) <= 3 && \result <= 2) && 2 <= \result)) || \old(n) <= 2) - ProcedureContractResult [Line: 7]: Procedure Contract for fibo1 Derived contract for procedure fibo1: (n == \old(n) && ((((((\old(n) <= 1 && \result <= 1) && 1 <= \result) || \old(n) <= 0) || 7 <= \old(n)) || (((\old(n) <= 3 && 2 <= \result) && \result <= 2) && 3 <= \old(n))) || (5 <= n && (\old(n) <= 5 || (8 <= \result && \result <= 8))))) && ((0 <= \result && \result <= 0) || 0 < n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 22.1s, OverallIterations: 21, TraceHistogramMax: 23, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 40.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1072 SDtfs, 1210 SDslu, 7563 SDs, 0 SdLazy, 5632 SolverSat, 507 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1192 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 252 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 4301 PreInvPairs, 10789 NumberOfFragments, 1516 HoareAnnotationTreeSize, 4301 FomulaSimplifications, 448447 FormulaSimplificationTreeSizeReduction, 28.0s HoareSimplificationTime, 45 FomulaSimplificationsInter, 110615 FormulaSimplificationTreeSizeReductionInter, 12.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...