/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=1000 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLEST --traceabstraction.additional.smt.options log-additional-information=true -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-177f698 [2020-08-21 16:30:03,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 16:30:03,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 16:30:03,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 16:30:03,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 16:30:03,222 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 16:30:03,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 16:30:03,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 16:30:03,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 16:30:03,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 16:30:03,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 16:30:03,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 16:30:03,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 16:30:03,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 16:30:03,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 16:30:03,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 16:30:03,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 16:30:03,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 16:30:03,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 16:30:03,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 16:30:03,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 16:30:03,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 16:30:03,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 16:30:03,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 16:30:03,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 16:30:03,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 16:30:03,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 16:30:03,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 16:30:03,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 16:30:03,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 16:30:03,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 16:30:03,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 16:30:03,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 16:30:03,288 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 16:30:03,289 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 16:30:03,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 16:30:03,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 16:30:03,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 16:30:03,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 16:30:03,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 16:30:03,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 16:30:03,293 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-21 16:30:03,316 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 16:30:03,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 16:30:03,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 16:30:03,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 16:30:03,321 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 16:30:03,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 16:30:03,321 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 16:30:03,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 16:30:03,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 16:30:03,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 16:30:03,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 16:30:03,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 16:30:03,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 16:30:03,323 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 16:30:03,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 16:30:03,323 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 16:30:03,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 16:30:03,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 16:30:03,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 16:30:03,324 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 16:30:03,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 16:30:03,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 16:30:03,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 16:30:03,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 16:30:03,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 16:30:03,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 16:30:03,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 16:30:03,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 16:30:03,326 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 16:30:03,326 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=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; [2020-08-21 16:30:03,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 16:30:03,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 16:30:03,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 16:30:03,647 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 16:30:03,647 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 16:30:03,648 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-21 16:30:03,723 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f4c259aaf/b6df4e80c8ca487a9bc7598272bedc23/FLAG90d3fcd54 [2020-08-21 16:30:04,189 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 16:30:04,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-21 16:30:04,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f4c259aaf/b6df4e80c8ca487a9bc7598272bedc23/FLAG90d3fcd54 [2020-08-21 16:30:04,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f4c259aaf/b6df4e80c8ca487a9bc7598272bedc23 [2020-08-21 16:30:04,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 16:30:04,595 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 16:30:04,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 16:30:04,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 16:30:04,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 16:30:04,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 04:30:04" (1/1) ... [2020-08-21 16:30:04,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c3d6b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 04:30:04, skipping insertion in model container [2020-08-21 16:30:04,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 04:30:04" (1/1) ... [2020-08-21 16:30:04,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 16:30:04,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 16:30:04,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 16:30:04,816 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 16:30:04,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 16:30:04,839 INFO L208 MainTranslator]: Completed translation [2020-08-21 16:30:04,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 04:30:04 WrapperNode [2020-08-21 16:30:04,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 16:30:04,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 16:30:04,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 16:30:04,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 16:30:04,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 04:30:04" (1/1) ... [2020-08-21 16:30:04,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 04:30:04" (1/1) ... [2020-08-21 16:30:04,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 04:30:04" (1/1) ... [2020-08-21 16:30:04,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 04:30:04" (1/1) ... [2020-08-21 16:30:04,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 04:30:04" (1/1) ... [2020-08-21 16:30:04,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 04:30:04" (1/1) ... [2020-08-21 16:30:04,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 04:30:04" (1/1) ... [2020-08-21 16:30:04,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 16:30:04,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 16:30:04,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 16:30:04,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 16:30:04,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 04:30:04" (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-21 16:30:05,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 16:30:05,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 16:30:05,032 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-08-21 16:30:05,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 16:30:05,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 16:30:05,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 16:30:05,033 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-08-21 16:30:05,033 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 16:30:05,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 16:30:05,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 16:30:05,210 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 16:30:05,210 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-21 16:30:05,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 04:30:05 BoogieIcfgContainer [2020-08-21 16:30:05,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 16:30:05,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 16:30:05,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 16:30:05,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 16:30:05,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 04:30:04" (1/3) ... [2020-08-21 16:30:05,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a700345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 04:30:05, skipping insertion in model container [2020-08-21 16:30:05,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 04:30:04" (2/3) ... [2020-08-21 16:30:05,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a700345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 04:30:05, skipping insertion in model container [2020-08-21 16:30:05,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 04:30:05" (3/3) ... [2020-08-21 16:30:05,223 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-08-21 16:30:05,234 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 16:30:05,242 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 16:30:05,257 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 16:30:05,282 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 16:30:05,283 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 16:30:05,283 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 16:30:05,283 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 16:30:05,283 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 16:30:05,283 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 16:30:05,283 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 16:30:05,284 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 16:30:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-08-21 16:30:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-21 16:30:05,310 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 16:30:05,311 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 16:30:05,311 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 16:30:05,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 16:30:05,318 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-08-21 16:30:05,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 16:30:05,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1925691358] [2020-08-21 16:30:05,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 16:30:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:05,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 16:30:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:05,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 16:30:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:05,547 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-21 16:30:05,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1925691358] [2020-08-21 16:30:05,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 16:30:05,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 16:30:05,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862418222] [2020-08-21 16:30:05,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 16:30:05,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 16:30:05,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 16:30:05,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 16:30:05,577 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-08-21 16:30:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 16:30:05,691 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-21 16:30:05,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 16:30:05,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-21 16:30:05,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 16:30:05,707 INFO L225 Difference]: With dead ends: 35 [2020-08-21 16:30:05,708 INFO L226 Difference]: Without dead ends: 21 [2020-08-21 16:30:05,712 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-21 16:30:05,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-21 16:30:05,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-21 16:30:05,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 16:30:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 16:30:05,814 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-21 16:30:05,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 16:30:05,815 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 16:30:05,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 16:30:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 16:30:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-21 16:30:05,820 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 16:30:05,820 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 16:30:05,820 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 16:30:05,824 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 16:30:05,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 16:30:05,825 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-08-21 16:30:05,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 16:30:05,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1539843614] [2020-08-21 16:30:05,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 16:30:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:05,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 16:30:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:05,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 16:30:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:05,968 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-21 16:30:05,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1539843614] [2020-08-21 16:30:05,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 16:30:05,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 16:30:05,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443245998] [2020-08-21 16:30:05,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 16:30:05,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 16:30:05,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 16:30:05,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 16:30:05,973 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-21 16:30:06,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 16:30:06,035 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-21 16:30:06,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 16:30:06,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-21 16:30:06,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 16:30:06,037 INFO L225 Difference]: With dead ends: 27 [2020-08-21 16:30:06,037 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 16:30:06,038 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-21 16:30:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 16:30:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-21 16:30:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 16:30:06,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 16:30:06,047 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-21 16:30:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 16:30:06,048 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 16:30:06,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 16:30:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 16:30:06,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-21 16:30:06,050 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 16:30:06,050 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-21 16:30:06,050 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 16:30:06,051 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 16:30:06,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 16:30:06,051 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-08-21 16:30:06,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 16:30:06,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [419531282] [2020-08-21 16:30:06,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 16:30:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 16:30:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 16:30:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-21 16:30:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,210 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-21 16:30:06,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [419531282] [2020-08-21 16:30:06,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 16:30:06,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 16:30:06,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726448651] [2020-08-21 16:30:06,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 16:30:06,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 16:30:06,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 16:30:06,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-21 16:30:06,213 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states. [2020-08-21 16:30:06,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 16:30:06,325 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-21 16:30:06,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 16:30:06,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-08-21 16:30:06,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 16:30:06,329 INFO L225 Difference]: With dead ends: 38 [2020-08-21 16:30:06,330 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 16:30:06,331 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-21 16:30:06,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 16:30:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-21 16:30:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-21 16:30:06,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-21 16:30:06,347 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-21 16:30:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 16:30:06,349 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-21 16:30:06,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 16:30:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-21 16:30:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-21 16:30:06,352 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 16:30:06,352 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-21 16:30:06,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 16:30:06,354 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 16:30:06,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 16:30:06,355 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-08-21 16:30:06,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 16:30:06,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1408270548] [2020-08-21 16:30:06,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 16:30:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 16:30:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 16:30:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,482 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-21 16:30:06,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1408270548] [2020-08-21 16:30:06,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 16:30:06,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 16:30:06,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513366228] [2020-08-21 16:30:06,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 16:30:06,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 16:30:06,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 16:30:06,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 16:30:06,486 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-21 16:30:06,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 16:30:06,635 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-21 16:30:06,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 16:30:06,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-21 16:30:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 16:30:06,638 INFO L225 Difference]: With dead ends: 41 [2020-08-21 16:30:06,638 INFO L226 Difference]: Without dead ends: 37 [2020-08-21 16:30:06,639 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-21 16:30:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-21 16:30:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-21 16:30:06,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-21 16:30:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-21 16:30:06,651 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-21 16:30:06,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 16:30:06,652 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-21 16:30:06,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 16:30:06,652 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-21 16:30:06,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-21 16:30:06,654 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 16:30:06,654 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-21 16:30:06,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 16:30:06,655 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 16:30:06,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 16:30:06,655 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-08-21 16:30:06,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 16:30:06,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [489278655] [2020-08-21 16:30:06,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 16:30:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 16:30:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 16:30:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:06,828 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-21 16:30:06,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [489278655] [2020-08-21 16:30:06,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 16:30:06,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-21 16:30:06,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924143990] [2020-08-21 16:30:06,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 16:30:06,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 16:30:06,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 16:30:06,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-21 16:30:06,831 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 8 states. [2020-08-21 16:30:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 16:30:06,955 INFO L93 Difference]: Finished difference Result 79 states and 124 transitions. [2020-08-21 16:30:06,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-21 16:30:06,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-08-21 16:30:06,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 16:30:06,958 INFO L225 Difference]: With dead ends: 79 [2020-08-21 16:30:06,959 INFO L226 Difference]: Without dead ends: 48 [2020-08-21 16:30:06,960 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-08-21 16:30:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-21 16:30:06,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-08-21 16:30:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-21 16:30:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2020-08-21 16:30:06,973 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 40 [2020-08-21 16:30:06,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 16:30:06,973 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-08-21 16:30:06,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 16:30:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2020-08-21 16:30:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-21 16:30:06,976 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 16:30:06,976 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-21 16:30:06,976 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 16:30:06,977 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 16:30:06,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 16:30:06,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 3 times [2020-08-21 16:30:06,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 16:30:06,978 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [788651276] [2020-08-21 16:30:06,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 16:30:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 16:30:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 16:30:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,086 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-21 16:30:07,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [788651276] [2020-08-21 16:30:07,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 16:30:07,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 16:30:07,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642031548] [2020-08-21 16:30:07,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 16:30:07,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 16:30:07,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 16:30:07,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 16:30:07,089 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand 7 states. [2020-08-21 16:30:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 16:30:07,198 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2020-08-21 16:30:07,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 16:30:07,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-21 16:30:07,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 16:30:07,201 INFO L225 Difference]: With dead ends: 65 [2020-08-21 16:30:07,201 INFO L226 Difference]: Without dead ends: 61 [2020-08-21 16:30:07,202 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-21 16:30:07,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-08-21 16:30:07,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-08-21 16:30:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-08-21 16:30:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2020-08-21 16:30:07,217 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 41 [2020-08-21 16:30:07,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 16:30:07,217 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2020-08-21 16:30:07,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 16:30:07,218 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2020-08-21 16:30:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-21 16:30:07,221 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 16:30:07,222 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-21 16:30:07,222 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 16:30:07,222 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 16:30:07,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 16:30:07,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 4 times [2020-08-21 16:30:07,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 16:30:07,223 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [364867912] [2020-08-21 16:30:07,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 16:30:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 16:30:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 16:30:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:07,521 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-21 16:30:07,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [364867912] [2020-08-21 16:30:07,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 16:30:07,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-21 16:30:07,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964367685] [2020-08-21 16:30:07,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-21 16:30:07,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 16:30:07,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-21 16:30:07,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-08-21 16:30:07,524 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 11 states. [2020-08-21 16:30:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 16:30:07,918 INFO L93 Difference]: Finished difference Result 107 states and 178 transitions. [2020-08-21 16:30:07,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-21 16:30:07,919 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-08-21 16:30:07,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 16:30:07,924 INFO L225 Difference]: With dead ends: 107 [2020-08-21 16:30:07,926 INFO L226 Difference]: Without dead ends: 57 [2020-08-21 16:30:07,932 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-21 16:30:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-21 16:30:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-08-21 16:30:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-21 16:30:07,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2020-08-21 16:30:07,957 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 82 [2020-08-21 16:30:07,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 16:30:07,958 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2020-08-21 16:30:07,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-21 16:30:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2020-08-21 16:30:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-21 16:30:07,969 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 16:30:07,972 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-21 16:30:07,973 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 16:30:07,973 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 16:30:07,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 16:30:07,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1040445716, now seen corresponding path program 5 times [2020-08-21 16:30:07,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 16:30:07,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [217672089] [2020-08-21 16:30:07,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 16:30:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 16:30:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 16:30:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 16:30:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:08,440 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-21 16:30:08,440 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [217672089] [2020-08-21 16:30:08,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 16:30:08,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-21 16:30:08,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174514701] [2020-08-21 16:30:08,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-21 16:30:08,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 16:30:08,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-21 16:30:08,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-08-21 16:30:08,443 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand 13 states. [2020-08-21 16:30:08,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 16:30:08,970 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2020-08-21 16:30:08,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-21 16:30:08,970 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 136 [2020-08-21 16:30:08,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 16:30:08,973 INFO L225 Difference]: With dead ends: 115 [2020-08-21 16:30:08,973 INFO L226 Difference]: Without dead ends: 74 [2020-08-21 16:30:08,974 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2020-08-21 16:30:08,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-08-21 16:30:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2020-08-21 16:30:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-21 16:30:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2020-08-21 16:30:08,990 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 136 [2020-08-21 16:30:08,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 16:30:08,991 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2020-08-21 16:30:08,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-21 16:30:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2020-08-21 16:30:08,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-21 16:30:08,993 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 16:30:08,993 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-21 16:30:08,994 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-21 16:30:08,997 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 16:30:08,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 16:30:08,998 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 6 times [2020-08-21 16:30:08,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 16:30:08,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1170052099] [2020-08-21 16:30:08,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 16:30:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 16:30:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 16:30:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 16:30:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 16:30:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,532 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-21 16:30:09,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1170052099] [2020-08-21 16:30:09,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 16:30:09,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-21 16:30:09,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505806760] [2020-08-21 16:30:09,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 16:30:09,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 16:30:09,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 16:30:09,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-21 16:30:09,542 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 10 states. [2020-08-21 16:30:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 16:30:09,747 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2020-08-21 16:30:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-21 16:30:09,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-21 16:30:09,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 16:30:09,757 INFO L225 Difference]: With dead ends: 186 [2020-08-21 16:30:09,759 INFO L226 Difference]: Without dead ends: 182 [2020-08-21 16:30:09,760 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-21 16:30:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-08-21 16:30:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2020-08-21 16:30:09,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-08-21 16:30:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2020-08-21 16:30:09,808 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 177 [2020-08-21 16:30:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 16:30:09,808 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2020-08-21 16:30:09,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 16:30:09,808 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2020-08-21 16:30:09,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-08-21 16:30:09,816 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 16:30:09,817 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-21 16:30:09,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-21 16:30:09,817 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 16:30:09,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 16:30:09,818 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 7 times [2020-08-21 16:30:09,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 16:30:09,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [565241642] [2020-08-21 16:30:09,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 16:30:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 16:30:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:09,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 16:30:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 16:30:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 16:30:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 16:30:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 16:30:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 16:30:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:10,875 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-21 16:30:10,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [565241642] [2020-08-21 16:30:10,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 16:30:10,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-21 16:30:10,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127893686] [2020-08-21 16:30:10,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-21 16:30:10,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 16:30:10,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-21 16:30:10,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-08-21 16:30:10,879 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand 17 states. [2020-08-21 16:30:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 16:30:11,722 INFO L93 Difference]: Finished difference Result 281 states and 495 transitions. [2020-08-21 16:30:11,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-08-21 16:30:11,722 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 327 [2020-08-21 16:30:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 16:30:11,725 INFO L225 Difference]: With dead ends: 281 [2020-08-21 16:30:11,725 INFO L226 Difference]: Without dead ends: 125 [2020-08-21 16:30:11,727 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2020-08-21 16:30:11,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-08-21 16:30:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2020-08-21 16:30:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-08-21 16:30:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2020-08-21 16:30:11,740 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 327 [2020-08-21 16:30:11,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 16:30:11,741 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2020-08-21 16:30:11,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-21 16:30:11,741 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2020-08-21 16:30:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2020-08-21 16:30:11,753 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 16:30:11,754 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-21 16:30:11,754 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-21 16:30:11,754 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 16:30:11,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 16:30:11,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1569959394, now seen corresponding path program 8 times [2020-08-21 16:30:11,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 16:30:11,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [772073145] [2020-08-21 16:30:11,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 16:30:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 16:30:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 16:30:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 16:30:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 16:30:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 16:30:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 16:30:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-21 16:30:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:12,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 16:30:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 16:30:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 16:30:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-08-21 16:30:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:13,845 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-21 16:30:13,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [772073145] [2020-08-21 16:30:13,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 16:30:13,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-21 16:30:13,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572272733] [2020-08-21 16:30:13,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-21 16:30:13,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 16:30:13,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-21 16:30:13,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-08-21 16:30:13,849 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand 19 states. [2020-08-21 16:30:14,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 16:30:14,878 INFO L93 Difference]: Finished difference Result 226 states and 393 transitions. [2020-08-21 16:30:14,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-08-21 16:30:14,879 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 599 [2020-08-21 16:30:14,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 16:30:14,882 INFO L225 Difference]: With dead ends: 226 [2020-08-21 16:30:14,882 INFO L226 Difference]: Without dead ends: 136 [2020-08-21 16:30:14,884 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-21 16:30:14,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-08-21 16:30:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2020-08-21 16:30:14,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-08-21 16:30:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2020-08-21 16:30:14,904 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 599 [2020-08-21 16:30:14,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 16:30:14,905 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2020-08-21 16:30:14,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-21 16:30:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2020-08-21 16:30:14,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2020-08-21 16:30:14,928 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 16:30:14,928 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-21 16:30:14,928 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-21 16:30:14,929 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 16:30:14,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 16:30:14,929 INFO L82 PathProgramCache]: Analyzing trace with hash -127293739, now seen corresponding path program 9 times [2020-08-21 16:30:14,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 16:30:14,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [523222968] [2020-08-21 16:30:14,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 16:30:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:15,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 16:30:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:15,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 16:30:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:15,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 16:30:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 16:30:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 16:30:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 16:30:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-21 16:30:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 16:30:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 16:30:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:16,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-08-21 16:30:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 16:30:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 16:30:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 16:30:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 16:30:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 16:30:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 16:30:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 16:30:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 16:30:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 16:30:17,963 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-21 16:30:17,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [523222968] [2020-08-21 16:30:17,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 16:30:17,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-21 16:30:17,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901275262] [2020-08-21 16:30:17,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-21 16:30:17,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 16:30:17,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-21 16:30:17,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-21 16:30:17,968 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand 13 states. [2020-08-21 16:30:18,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 16:30:18,310 INFO L93 Difference]: Finished difference Result 486 states and 772 transitions. [2020-08-21 16:30:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-21 16:30:18,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 749 [2020-08-21 16:30:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 16:30:18,322 INFO L225 Difference]: With dead ends: 486 [2020-08-21 16:30:18,323 INFO L226 Difference]: Without dead ends: 482 [2020-08-21 16:30:18,324 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-21 16:30:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-08-21 16:30:18,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 461. [2020-08-21 16:30:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-08-21 16:30:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 725 transitions. [2020-08-21 16:30:18,384 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 725 transitions. Word has length 749 [2020-08-21 16:30:18,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 16:30:18,385 INFO L479 AbstractCegarLoop]: Abstraction has 461 states and 725 transitions. [2020-08-21 16:30:18,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-21 16:30:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 725 transitions. [2020-08-21 16:30:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-08-21 16:30:18,398 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 16:30:18,398 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-21 16:30:18,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-21 16:30:18,399 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 16:30:18,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 16:30:18,399 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 10 times [2020-08-21 16:30:18,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 16:30:18,400 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [405381458] [2020-08-21 16:30:18,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 16:30:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-21 16:30:19,117 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-21 16:30:19,117 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-21 16:30:19,125 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-21 16:30:19,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 04:30:19 BoogieIcfgContainer [2020-08-21 16:30:19,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 16:30:19,204 INFO L168 Benchmark]: Toolchain (without parser) took 14608.80 ms. Allocated memory was 140.5 MB in the beginning and 827.9 MB in the end (delta: 687.3 MB). Free memory was 103.5 MB in the beginning and 611.7 MB in the end (delta: -508.2 MB). Peak memory consumption was 705.3 MB. Max. memory is 7.1 GB. [2020-08-21 16:30:19,205 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-21 16:30:19,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.31 ms. Allocated memory is still 140.5 MB. Free memory was 103.3 MB in the beginning and 93.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-08-21 16:30:19,207 INFO L168 Benchmark]: Boogie Preprocessor took 105.77 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 93.6 MB in the beginning and 182.6 MB in the end (delta: -89.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-08-21 16:30:19,207 INFO L168 Benchmark]: RCFGBuilder took 267.63 ms. Allocated memory is still 203.4 MB. Free memory was 182.6 MB in the beginning and 170.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2020-08-21 16:30:19,208 INFO L168 Benchmark]: TraceAbstraction took 13986.30 ms. Allocated memory was 203.4 MB in the beginning and 827.9 MB in the end (delta: 624.4 MB). Free memory was 170.1 MB in the beginning and 611.7 MB in the end (delta: -441.6 MB). Peak memory consumption was 709.0 MB. Max. memory is 7.1 GB. [2020-08-21 16:30:19,211 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.27 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 241.31 ms. Allocated memory is still 140.5 MB. Free memory was 103.3 MB in the beginning and 93.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.77 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 93.6 MB in the beginning and 182.6 MB in the end (delta: -89.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 267.63 ms. Allocated memory is still 203.4 MB. Free memory was 182.6 MB in the beginning and 170.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13986.30 ms. Allocated memory was 203.4 MB in the beginning and 827.9 MB in the end (delta: 624.4 MB). Free memory was 170.1 MB in the beginning and 611.7 MB in the end (delta: -441.6 MB). Peak memory consumption was 709.0 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.8s, 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, 1804 SolverSat, 740 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.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 87 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.4s 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...