/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 --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.5 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 06:46:41,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 06:46:41,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 06:46:41,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 06:46:41,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 06:46:41,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 06:46:41,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 06:46:41,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 06:46:41,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 06:46:41,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 06:46:41,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 06:46:41,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 06:46:41,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 06:46:41,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 06:46:41,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 06:46:41,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 06:46:41,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 06:46:41,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 06:46:41,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 06:46:41,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 06:46:41,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 06:46:41,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 06:46:41,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 06:46:41,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 06:46:41,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 06:46:41,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 06:46:41,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 06:46:41,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 06:46:41,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 06:46:41,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 06:46:41,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 06:46:41,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 06:46:41,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 06:46:41,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 06:46:41,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 06:46:41,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 06:46:41,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 06:46:41,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 06:46:41,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 06:46:41,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 06:46:41,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 06:46:41,149 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-19 06:46:41,172 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 06:46:41,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 06:46:41,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 06:46:41,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 06:46:41,174 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 06:46:41,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 06:46:41,175 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 06:46:41,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 06:46:41,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 06:46:41,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 06:46:41,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 06:46:41,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 06:46:41,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 06:46:41,176 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 06:46:41,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 06:46:41,176 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 06:46:41,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 06:46:41,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 06:46:41,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 06:46:41,177 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 06:46:41,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 06:46:41,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 06:46:41,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 06:46:41,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 06:46:41,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 06:46:41,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 06:46:41,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 06:46:41,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 06:46:41,179 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 06:46:41,179 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.5; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.5; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.5; [2020-08-19 06:46:41,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 06:46:41,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 06:46:41,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 06:46:41,508 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 06:46:41,508 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 06:46:41,509 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-19 06:46:41,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6f07529c6/b69f0a8c431f42cd9d891f2b6a743d3d/FLAG12a73a14d [2020-08-19 06:46:42,064 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 06:46:42,064 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-19 06:46:42,073 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6f07529c6/b69f0a8c431f42cd9d891f2b6a743d3d/FLAG12a73a14d [2020-08-19 06:46:42,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6f07529c6/b69f0a8c431f42cd9d891f2b6a743d3d [2020-08-19 06:46:42,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 06:46:42,493 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 06:46:42,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 06:46:42,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 06:46:42,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 06:46:42,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 06:46:42" (1/1) ... [2020-08-19 06:46:42,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23212c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:42, skipping insertion in model container [2020-08-19 06:46:42,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 06:46:42" (1/1) ... [2020-08-19 06:46:42,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 06:46:42,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 06:46:42,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 06:46:42,697 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 06:46:42,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 06:46:42,728 INFO L208 MainTranslator]: Completed translation [2020-08-19 06:46:42,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:42 WrapperNode [2020-08-19 06:46:42,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 06:46:42,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 06:46:42,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 06:46:42,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 06:46:42,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:42" (1/1) ... [2020-08-19 06:46:42,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:42" (1/1) ... [2020-08-19 06:46:42,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:42" (1/1) ... [2020-08-19 06:46:42,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:42" (1/1) ... [2020-08-19 06:46:42,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:42" (1/1) ... [2020-08-19 06:46:42,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:42" (1/1) ... [2020-08-19 06:46:42,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:42" (1/1) ... [2020-08-19 06:46:42,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 06:46:42,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 06:46:42,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 06:46:42,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 06:46:42,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:42" (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-08-19 06:46:42,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 06:46:42,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 06:46:42,894 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-08-19 06:46:42,894 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 06:46:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-19 06:46:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 06:46:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-08-19 06:46:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 06:46:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 06:46:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 06:46:43,070 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 06:46:43,070 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 06:46:43,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 06:46:43 BoogieIcfgContainer [2020-08-19 06:46:43,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 06:46:43,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 06:46:43,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 06:46:43,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 06:46:43,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 06:46:42" (1/3) ... [2020-08-19 06:46:43,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a23298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 06:46:43, skipping insertion in model container [2020-08-19 06:46:43,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:42" (2/3) ... [2020-08-19 06:46:43,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a23298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 06:46:43, skipping insertion in model container [2020-08-19 06:46:43,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 06:46:43" (3/3) ... [2020-08-19 06:46:43,083 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-08-19 06:46:43,094 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 06:46:43,101 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 06:46:43,115 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 06:46:43,140 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 06:46:43,140 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 06:46:43,140 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 06:46:43,141 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 06:46:43,141 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 06:46:43,141 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 06:46:43,141 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 06:46:43,141 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 06:46:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-08-19 06:46:43,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-19 06:46:43,166 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:43,167 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:46:43,168 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:43,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:43,174 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-08-19 06:46:43,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:43,184 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1536241257] [2020-08-19 06:46:43,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:43,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:43,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:46:43,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1536241257] [2020-08-19 06:46:43,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:46:43,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 06:46:43,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969626698] [2020-08-19 06:46:43,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 06:46:43,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:43,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 06:46:43,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 06:46:43,420 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-08-19 06:46:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:43,527 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-19 06:46:43,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 06:46:43,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-19 06:46:43,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:43,541 INFO L225 Difference]: With dead ends: 35 [2020-08-19 06:46:43,541 INFO L226 Difference]: Without dead ends: 21 [2020-08-19 06:46:43,545 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-19 06:46:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-19 06:46:43,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-19 06:46:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 06:46:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 06:46:43,593 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-19 06:46:43,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:43,594 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 06:46:43,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 06:46:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 06:46:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-19 06:46:43,597 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:43,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:46:43,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 06:46:43,597 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:43,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:43,598 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-08-19 06:46:43,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:43,599 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [421090501] [2020-08-19 06:46:43,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:43,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:43,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 06:46:43,667 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [421090501] [2020-08-19 06:46:43,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:46:43,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 06:46:43,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425274800] [2020-08-19 06:46:43,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 06:46:43,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:43,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 06:46:43,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 06:46:43,672 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-19 06:46:43,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:43,746 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-19 06:46:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 06:46:43,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-19 06:46:43,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:43,748 INFO L225 Difference]: With dead ends: 27 [2020-08-19 06:46:43,749 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 06:46:43,750 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-19 06:46:43,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 06:46:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-19 06:46:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 06:46:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 06:46:43,759 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-19 06:46:43,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:43,759 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 06:46:43,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 06:46:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 06:46:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-19 06:46:43,761 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:43,761 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:46:43,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 06:46:43,762 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:43,763 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-08-19 06:46:43,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:43,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1161082928] [2020-08-19 06:46:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:43,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:43,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:43,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:43,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-19 06:46:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-19 06:46:43,893 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1161082928] [2020-08-19 06:46:43,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:43,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 06:46:43,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317321689] [2020-08-19 06:46:43,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 06:46:43,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:43,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 06:46:43,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-19 06:46:43,895 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states. [2020-08-19 06:46:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:44,015 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-19 06:46:44,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 06:46:44,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-08-19 06:46:44,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:44,018 INFO L225 Difference]: With dead ends: 38 [2020-08-19 06:46:44,018 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 06:46:44,019 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-19 06:46:44,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 06:46:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-19 06:46:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-19 06:46:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-19 06:46:44,027 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-19 06:46:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:44,027 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-19 06:46:44,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 06:46:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-19 06:46:44,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-19 06:46:44,029 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:44,030 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:46:44,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 06:46:44,033 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:44,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:44,034 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-08-19 06:46:44,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:44,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1884372452] [2020-08-19 06:46:44,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-19 06:46:44,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1884372452] [2020-08-19 06:46:44,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:44,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 06:46:44,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218684498] [2020-08-19 06:46:44,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 06:46:44,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:44,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 06:46:44,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 06:46:44,172 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-19 06:46:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:44,301 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-19 06:46:44,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 06:46:44,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-19 06:46:44,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:44,304 INFO L225 Difference]: With dead ends: 41 [2020-08-19 06:46:44,304 INFO L226 Difference]: Without dead ends: 37 [2020-08-19 06:46:44,305 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-19 06:46:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-19 06:46:44,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-19 06:46:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-19 06:46:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-19 06:46:44,317 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-19 06:46:44,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:44,317 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-19 06:46:44,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 06:46:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-19 06:46:44,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-19 06:46:44,320 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:44,320 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:46:44,320 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 06:46:44,320 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:44,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:44,321 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-08-19 06:46:44,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:44,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [145047524] [2020-08-19 06:46:44,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-19 06:46:44,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [145047524] [2020-08-19 06:46:44,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:44,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 06:46:44,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116751495] [2020-08-19 06:46:44,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 06:46:44,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:44,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 06:46:44,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-19 06:46:44,561 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 8 states. [2020-08-19 06:46:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:44,709 INFO L93 Difference]: Finished difference Result 79 states and 124 transitions. [2020-08-19 06:46:44,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 06:46:44,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-08-19 06:46:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:44,712 INFO L225 Difference]: With dead ends: 79 [2020-08-19 06:46:44,712 INFO L226 Difference]: Without dead ends: 48 [2020-08-19 06:46:44,714 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-08-19 06:46:44,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-19 06:46:44,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-08-19 06:46:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-19 06:46:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2020-08-19 06:46:44,726 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 40 [2020-08-19 06:46:44,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:44,727 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-08-19 06:46:44,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 06:46:44,727 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2020-08-19 06:46:44,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-19 06:46:44,729 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:44,729 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:46:44,729 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 06:46:44,729 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:44,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:44,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 3 times [2020-08-19 06:46:44,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:44,731 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1564375002] [2020-08-19 06:46:44,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-19 06:46:44,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1564375002] [2020-08-19 06:46:44,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:44,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 06:46:44,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245508850] [2020-08-19 06:46:44,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 06:46:44,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:44,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 06:46:44,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 06:46:44,893 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand 7 states. [2020-08-19 06:46:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:45,004 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2020-08-19 06:46:45,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 06:46:45,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-19 06:46:45,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:45,007 INFO L225 Difference]: With dead ends: 65 [2020-08-19 06:46:45,007 INFO L226 Difference]: Without dead ends: 61 [2020-08-19 06:46:45,008 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 06:46:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-08-19 06:46:45,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-08-19 06:46:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-08-19 06:46:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2020-08-19 06:46:45,023 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 41 [2020-08-19 06:46:45,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:45,023 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2020-08-19 06:46:45,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 06:46:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2020-08-19 06:46:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-19 06:46:45,028 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:45,028 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:46:45,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 06:46:45,029 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:45,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:45,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 4 times [2020-08-19 06:46:45,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:45,030 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1348993814] [2020-08-19 06:46:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 77 proven. 104 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-08-19 06:46:45,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1348993814] [2020-08-19 06:46:45,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:45,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-19 06:46:45,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095002759] [2020-08-19 06:46:45,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 06:46:45,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:45,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 06:46:45,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-08-19 06:46:45,361 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 11 states. [2020-08-19 06:46:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:45,748 INFO L93 Difference]: Finished difference Result 107 states and 178 transitions. [2020-08-19 06:46:45,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-19 06:46:45,749 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-08-19 06:46:45,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:45,752 INFO L225 Difference]: With dead ends: 107 [2020-08-19 06:46:45,752 INFO L226 Difference]: Without dead ends: 57 [2020-08-19 06:46:45,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2020-08-19 06:46:45,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-19 06:46:45,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-08-19 06:46:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-19 06:46:45,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2020-08-19 06:46:45,765 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 82 [2020-08-19 06:46:45,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:45,766 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2020-08-19 06:46:45,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 06:46:45,766 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2020-08-19 06:46:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-19 06:46:45,771 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:45,771 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:46:45,771 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 06:46:45,771 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:45,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:45,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1040445716, now seen corresponding path program 5 times [2020-08-19 06:46:45,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:45,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1726132011] [2020-08-19 06:46:45,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:45,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 193 proven. 313 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2020-08-19 06:46:46,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1726132011] [2020-08-19 06:46:46,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:46,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-19 06:46:46,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020554688] [2020-08-19 06:46:46,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-19 06:46:46,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:46,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-19 06:46:46,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-08-19 06:46:46,163 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand 13 states. [2020-08-19 06:46:46,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:46,644 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2020-08-19 06:46:46,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-19 06:46:46,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 136 [2020-08-19 06:46:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:46,647 INFO L225 Difference]: With dead ends: 115 [2020-08-19 06:46:46,647 INFO L226 Difference]: Without dead ends: 74 [2020-08-19 06:46:46,648 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2020-08-19 06:46:46,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-08-19 06:46:46,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2020-08-19 06:46:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-19 06:46:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2020-08-19 06:46:46,667 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 136 [2020-08-19 06:46:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:46,668 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2020-08-19 06:46:46,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-19 06:46:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2020-08-19 06:46:46,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-19 06:46:46,670 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:46,671 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:46:46,671 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 06:46:46,671 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:46,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:46,671 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 6 times [2020-08-19 06:46:46,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:46,672 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1376894646] [2020-08-19 06:46:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 06:46:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:46,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-19 06:46:47,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1376894646] [2020-08-19 06:46:47,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:47,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 06:46:47,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743757908] [2020-08-19 06:46:47,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 06:46:47,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:47,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 06:46:47,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 06:46:47,069 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 10 states. [2020-08-19 06:46:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:47,342 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2020-08-19 06:46:47,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-19 06:46:47,343 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-19 06:46:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:47,346 INFO L225 Difference]: With dead ends: 186 [2020-08-19 06:46:47,347 INFO L226 Difference]: Without dead ends: 182 [2020-08-19 06:46:47,347 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-19 06:46:47,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-08-19 06:46:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2020-08-19 06:46:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-08-19 06:46:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2020-08-19 06:46:47,371 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 177 [2020-08-19 06:46:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:47,372 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2020-08-19 06:46:47,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 06:46:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2020-08-19 06:46:47,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-08-19 06:46:47,377 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:47,377 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:46:47,377 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 06:46:47,377 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:47,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:47,378 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 7 times [2020-08-19 06:46:47,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:47,378 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1377979125] [2020-08-19 06:46:47,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 06:46:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 06:46:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:47,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 06:46:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1358 proven. 1342 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2020-08-19 06:46:48,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1377979125] [2020-08-19 06:46:48,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:48,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-19 06:46:48,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803926110] [2020-08-19 06:46:48,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-19 06:46:48,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:48,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-19 06:46:48,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-08-19 06:46:48,369 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand 17 states. [2020-08-19 06:46:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:49,152 INFO L93 Difference]: Finished difference Result 281 states and 495 transitions. [2020-08-19 06:46:49,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-08-19 06:46:49,152 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 327 [2020-08-19 06:46:49,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:49,155 INFO L225 Difference]: With dead ends: 281 [2020-08-19 06:46:49,155 INFO L226 Difference]: Without dead ends: 125 [2020-08-19 06:46:49,160 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2020-08-19 06:46:49,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-08-19 06:46:49,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2020-08-19 06:46:49,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-08-19 06:46:49,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2020-08-19 06:46:49,191 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 327 [2020-08-19 06:46:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:49,192 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2020-08-19 06:46:49,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-19 06:46:49,192 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2020-08-19 06:46:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2020-08-19 06:46:49,209 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:49,210 INFO L422 BasicCegarLoop]: trace histogram [87, 87, 70, 43, 43, 43, 43, 43, 43, 43, 27, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:46:49,210 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 06:46:49,211 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:49,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:49,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1569959394, now seen corresponding path program 8 times [2020-08-19 06:46:49,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:49,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2106761803] [2020-08-19 06:46:49,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:49,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:49,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:49,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:49,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:49,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:49,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 06:46:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 06:46:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-19 06:46:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 06:46:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:50,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 06:46:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-08-19 06:46:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 3272 proven. 3796 refuted. 0 times theorem prover too weak. 13923 trivial. 0 not checked. [2020-08-19 06:46:51,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2106761803] [2020-08-19 06:46:51,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:51,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-19 06:46:51,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535546385] [2020-08-19 06:46:51,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-19 06:46:51,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:51,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-19 06:46:51,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-08-19 06:46:51,755 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand 19 states. [2020-08-19 06:46:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:52,788 INFO L93 Difference]: Finished difference Result 226 states and 393 transitions. [2020-08-19 06:46:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-08-19 06:46:52,789 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 599 [2020-08-19 06:46:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:52,793 INFO L225 Difference]: With dead ends: 226 [2020-08-19 06:46:52,793 INFO L226 Difference]: Without dead ends: 136 [2020-08-19 06:46:52,795 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=442, Invalid=1814, Unknown=0, NotChecked=0, Total=2256 [2020-08-19 06:46:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-08-19 06:46:52,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2020-08-19 06:46:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-08-19 06:46:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2020-08-19 06:46:52,809 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 599 [2020-08-19 06:46:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:52,810 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2020-08-19 06:46:52,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-19 06:46:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2020-08-19 06:46:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2020-08-19 06:46:52,842 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:52,843 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:46:52,843 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 06:46:52,843 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:52,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:52,844 INFO L82 PathProgramCache]: Analyzing trace with hash -127293739, now seen corresponding path program 9 times [2020-08-19 06:46:52,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:52,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1378027431] [2020-08-19 06:46:52,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:53,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:53,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:53,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:53,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 06:46:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 06:46:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-19 06:46:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 06:46:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-08-19 06:46:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 06:46:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 06:46:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:54,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2020-08-19 06:46:55,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1378027431] [2020-08-19 06:46:55,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:55,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-19 06:46:55,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774602968] [2020-08-19 06:46:55,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-19 06:46:55,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:55,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-19 06:46:55,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-19 06:46:55,615 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand 13 states. [2020-08-19 06:46:55,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:55,978 INFO L93 Difference]: Finished difference Result 486 states and 772 transitions. [2020-08-19 06:46:55,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-19 06:46:55,979 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 749 [2020-08-19 06:46:55,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:55,992 INFO L225 Difference]: With dead ends: 486 [2020-08-19 06:46:55,992 INFO L226 Difference]: Without dead ends: 482 [2020-08-19 06:46:55,994 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-08-19 06:46:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-08-19 06:46:56,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 461. [2020-08-19 06:46:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-08-19 06:46:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 725 transitions. [2020-08-19 06:46:56,049 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 725 transitions. Word has length 749 [2020-08-19 06:46:56,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:56,050 INFO L479 AbstractCegarLoop]: Abstraction has 461 states and 725 transitions. [2020-08-19 06:46:56,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-19 06:46:56,050 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 725 transitions. [2020-08-19 06:46:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-08-19 06:46:56,066 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:56,067 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:46:56,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 06:46:56,067 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:56,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:56,068 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 10 times [2020-08-19 06:46:56,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:56,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1535757702] [2020-08-19 06:46:56,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 06:46:56,616 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 06:46:56,616 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 06:46:56,636 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-19 06:46:56,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 06:46:56 BoogieIcfgContainer [2020-08-19 06:46:56,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 06:46:56,770 INFO L168 Benchmark]: Toolchain (without parser) took 14269.67 ms. Allocated memory was 140.0 MB in the beginning and 890.8 MB in the end (delta: 750.8 MB). Free memory was 103.2 MB in the beginning and 764.8 MB in the end (delta: -661.6 MB). Peak memory consumption was 656.1 MB. Max. memory is 7.1 GB. [2020-08-19 06:46:56,771 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-19 06:46:56,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.83 ms. Allocated memory is still 140.0 MB. Free memory was 103.0 MB in the beginning and 93.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-19 06:46:56,773 INFO L168 Benchmark]: Boogie Preprocessor took 101.18 ms. Allocated memory was 140.0 MB in the beginning and 201.9 MB in the end (delta: 61.9 MB). Free memory was 93.8 MB in the beginning and 180.9 MB in the end (delta: -87.2 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-08-19 06:46:56,774 INFO L168 Benchmark]: RCFGBuilder took 243.61 ms. Allocated memory is still 201.9 MB. Free memory was 180.9 MB in the beginning and 169.2 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2020-08-19 06:46:56,781 INFO L168 Benchmark]: TraceAbstraction took 13685.32 ms. Allocated memory was 201.9 MB in the beginning and 890.8 MB in the end (delta: 688.9 MB). Free memory was 168.6 MB in the beginning and 764.8 MB in the end (delta: -596.2 MB). Peak memory consumption was 659.6 MB. Max. memory is 7.1 GB. [2020-08-19 06:46:56,788 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 232.83 ms. Allocated memory is still 140.0 MB. Free memory was 103.0 MB in the beginning and 93.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 101.18 ms. Allocated memory was 140.0 MB in the beginning and 201.9 MB in the end (delta: 61.9 MB). Free memory was 93.8 MB in the beginning and 180.9 MB in the end (delta: -87.2 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 243.61 ms. Allocated memory is still 201.9 MB. Free memory was 180.9 MB in the beginning and 169.2 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13685.32 ms. Allocated memory was 201.9 MB in the beginning and 890.8 MB in the end (delta: 688.9 MB). Free memory was 168.6 MB in the beginning and 764.8 MB in the end (delta: -596.2 MB). Peak memory consumption was 659.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; [L25] CALL, EXPR fibo(x) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) [L25] int result = fibo(x); [L26] COND TRUE result == 55 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.5s, OverallIterations: 13, TraceHistogramMax: 177, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 271 SDtfs, 753 SDslu, 879 SDs, 0 SdLazy, 1813 SolverSat, 738 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 898 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 87 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 3443 NumberOfCodeBlocks, 3443 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1448155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 52623/63131 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...