/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=5000 --traceabstraction.additional.smt.options interpolation-heuristic=BIGGEST --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 17:18:23,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 17:18:23,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 17:18:23,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 17:18:23,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 17:18:23,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 17:18:23,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 17:18:23,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 17:18:23,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 17:18:23,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 17:18:23,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 17:18:23,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 17:18:23,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 17:18:23,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 17:18:23,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 17:18:23,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 17:18:23,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 17:18:23,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 17:18:23,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 17:18:23,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 17:18:23,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 17:18:23,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 17:18:23,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 17:18:23,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 17:18:23,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 17:18:23,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 17:18:23,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 17:18:23,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 17:18:23,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 17:18:23,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 17:18:23,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 17:18:23,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 17:18:23,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 17:18:23,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 17:18:23,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 17:18:23,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 17:18:23,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 17:18:23,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 17:18:23,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 17:18:23,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 17:18:23,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 17:18:23,703 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 17:18:23,747 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 17:18:23,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 17:18:23,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 17:18:23,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 17:18:23,749 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 17:18:23,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 17:18:23,749 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 17:18:23,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 17:18:23,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 17:18:23,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 17:18:23,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 17:18:23,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 17:18:23,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 17:18:23,752 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 17:18:23,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 17:18:23,752 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 17:18:23,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 17:18:23,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 17:18:23,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 17:18:23,753 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 17:18:23,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 17:18:23,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 17:18:23,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 17:18:23,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 17:18:23,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 17:18:23,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 17:18:23,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 17:18:23,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 17:18:23,755 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 17:18:23,755 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=5000;interpolation-heuristic=BIGGEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=BIGGEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=BIGGEST;log-additional-information=true; [2020-08-21 17:18:24,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 17:18:24,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 17:18:24,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 17:18:24,121 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 17:18:24,122 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 17:18:24,123 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 17:18:24,200 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d3c368f0b/710b80a7fee3483c9cff64774fa00b5b/FLAG1fefbab66 [2020-08-21 17:18:24,657 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 17:18:24,658 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-21 17:18:24,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d3c368f0b/710b80a7fee3483c9cff64774fa00b5b/FLAG1fefbab66 [2020-08-21 17:18:25,027 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d3c368f0b/710b80a7fee3483c9cff64774fa00b5b [2020-08-21 17:18:25,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 17:18:25,037 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 17:18:25,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 17:18:25,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 17:18:25,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 17:18:25,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:18:25" (1/1) ... [2020-08-21 17:18:25,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51da39e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:25, skipping insertion in model container [2020-08-21 17:18:25,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:18:25" (1/1) ... [2020-08-21 17:18:25,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 17:18:25,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 17:18:25,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 17:18:25,251 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 17:18:25,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 17:18:25,282 INFO L208 MainTranslator]: Completed translation [2020-08-21 17:18:25,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:25 WrapperNode [2020-08-21 17:18:25,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 17:18:25,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 17:18:25,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 17:18:25,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 17:18:25,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:25" (1/1) ... [2020-08-21 17:18:25,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:25" (1/1) ... [2020-08-21 17:18:25,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:25" (1/1) ... [2020-08-21 17:18:25,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:25" (1/1) ... [2020-08-21 17:18:25,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:25" (1/1) ... [2020-08-21 17:18:25,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:25" (1/1) ... [2020-08-21 17:18:25,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:25" (1/1) ... [2020-08-21 17:18:25,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 17:18:25,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 17:18:25,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 17:18:25,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 17:18:25,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:25" (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 17:18:25,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 17:18:25,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 17:18:25,459 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-08-21 17:18:25,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 17:18:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 17:18:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 17:18:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-08-21 17:18:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 17:18:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 17:18:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 17:18:25,643 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 17:18:25,643 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-21 17:18:25,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:18:25 BoogieIcfgContainer [2020-08-21 17:18:25,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 17:18:25,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 17:18:25,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 17:18:25,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 17:18:25,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 05:18:25" (1/3) ... [2020-08-21 17:18:25,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a67c4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:18:25, skipping insertion in model container [2020-08-21 17:18:25,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:25" (2/3) ... [2020-08-21 17:18:25,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a67c4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:18:25, skipping insertion in model container [2020-08-21 17:18:25,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:18:25" (3/3) ... [2020-08-21 17:18:25,661 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-08-21 17:18:25,672 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 17:18:25,680 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 17:18:25,695 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 17:18:25,720 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 17:18:25,720 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 17:18:25,720 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 17:18:25,721 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 17:18:25,721 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 17:18:25,721 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 17:18:25,721 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 17:18:25,721 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 17:18:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-08-21 17:18:25,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-21 17:18:25,743 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:25,744 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:18:25,745 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:25,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:25,751 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-08-21 17:18:25,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:25,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [301444559] [2020-08-21 17:18:25,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:25,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:25,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:26,000 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 17:18:26,001 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [301444559] [2020-08-21 17:18:26,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:18:26,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 17:18:26,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763829932] [2020-08-21 17:18:26,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 17:18:26,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:26,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 17:18:26,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 17:18:26,032 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-08-21 17:18:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:26,140 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-21 17:18:26,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 17:18:26,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-21 17:18:26,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:26,155 INFO L225 Difference]: With dead ends: 35 [2020-08-21 17:18:26,156 INFO L226 Difference]: Without dead ends: 21 [2020-08-21 17:18:26,160 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 17:18:26,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-21 17:18:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-21 17:18:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 17:18:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 17:18:26,222 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-21 17:18:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:26,223 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 17:18:26,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 17:18:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 17:18:26,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-21 17:18:26,229 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:26,229 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:18:26,230 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 17:18:26,231 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:26,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:26,231 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-08-21 17:18:26,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:26,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2069458726] [2020-08-21 17:18:26,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:26,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:26,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:26,301 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 17:18:26,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2069458726] [2020-08-21 17:18:26,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:18:26,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 17:18:26,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334588472] [2020-08-21 17:18:26,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 17:18:26,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:26,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 17:18:26,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 17:18:26,306 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-21 17:18:26,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:26,383 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-21 17:18:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 17:18:26,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-21 17:18:26,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:26,386 INFO L225 Difference]: With dead ends: 27 [2020-08-21 17:18:26,386 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 17:18:26,387 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 17:18:26,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 17:18:26,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-21 17:18:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 17:18:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 17:18:26,396 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-21 17:18:26,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:26,397 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 17:18:26,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 17:18:26,397 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 17:18:26,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-21 17:18:26,398 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:26,399 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 17:18:26,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 17:18:26,399 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:26,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:26,400 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-08-21 17:18:26,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:26,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1919358072] [2020-08-21 17:18:26,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:26,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:26,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:26,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:26,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-21 17:18:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:26,585 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 17:18:26,586 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1919358072] [2020-08-21 17:18:26,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:26,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 17:18:26,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797781392] [2020-08-21 17:18:26,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 17:18:26,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:26,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 17:18:26,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-21 17:18:26,589 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states. [2020-08-21 17:18:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:26,701 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-21 17:18:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 17:18:26,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-08-21 17:18:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:26,703 INFO L225 Difference]: With dead ends: 38 [2020-08-21 17:18:26,703 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 17:18:26,705 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 17:18:26,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 17:18:26,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-21 17:18:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-21 17:18:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-21 17:18:26,713 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-21 17:18:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:26,714 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-21 17:18:26,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 17:18:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-21 17:18:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-21 17:18:26,716 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:26,716 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 17:18:26,716 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 17:18:26,717 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:26,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:26,718 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-08-21 17:18:26,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:26,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1989459468] [2020-08-21 17:18:26,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:26,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:26,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:26,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:26,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:26,838 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 17:18:26,838 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1989459468] [2020-08-21 17:18:26,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:26,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 17:18:26,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893027640] [2020-08-21 17:18:26,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 17:18:26,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:26,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 17:18:26,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 17:18:26,841 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-21 17:18:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:26,970 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-21 17:18:26,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 17:18:26,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-21 17:18:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:26,973 INFO L225 Difference]: With dead ends: 41 [2020-08-21 17:18:26,974 INFO L226 Difference]: Without dead ends: 37 [2020-08-21 17:18:26,975 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 17:18:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-21 17:18:26,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-21 17:18:26,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-21 17:18:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-21 17:18:26,987 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-21 17:18:26,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:26,987 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-21 17:18:26,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 17:18:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-21 17:18:26,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-21 17:18:26,989 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:26,990 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 17:18:26,990 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 17:18:26,990 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:26,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:26,991 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-08-21 17:18:26,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:26,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1599772058] [2020-08-21 17:18:26,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,245 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 17:18:27,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1599772058] [2020-08-21 17:18:27,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:27,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-21 17:18:27,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172860992] [2020-08-21 17:18:27,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 17:18:27,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:27,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 17:18:27,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-21 17:18:27,250 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 8 states. [2020-08-21 17:18:27,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:27,418 INFO L93 Difference]: Finished difference Result 79 states and 124 transitions. [2020-08-21 17:18:27,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-21 17:18:27,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-08-21 17:18:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:27,426 INFO L225 Difference]: With dead ends: 79 [2020-08-21 17:18:27,427 INFO L226 Difference]: Without dead ends: 48 [2020-08-21 17:18:27,428 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 17:18:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-21 17:18:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-08-21 17:18:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-21 17:18:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2020-08-21 17:18:27,454 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 40 [2020-08-21 17:18:27,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:27,454 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-08-21 17:18:27,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 17:18:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2020-08-21 17:18:27,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-21 17:18:27,459 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:27,459 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 17:18:27,460 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 17:18:27,462 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:27,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:27,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 3 times [2020-08-21 17:18:27,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:27,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2059905086] [2020-08-21 17:18:27,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,645 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 17:18:27,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2059905086] [2020-08-21 17:18:27,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:27,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 17:18:27,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089675664] [2020-08-21 17:18:27,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 17:18:27,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:27,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 17:18:27,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 17:18:27,648 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand 7 states. [2020-08-21 17:18:27,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:27,768 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2020-08-21 17:18:27,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 17:18:27,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-21 17:18:27,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:27,771 INFO L225 Difference]: With dead ends: 65 [2020-08-21 17:18:27,771 INFO L226 Difference]: Without dead ends: 61 [2020-08-21 17:18:27,772 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 17:18:27,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-08-21 17:18:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-08-21 17:18:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-08-21 17:18:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2020-08-21 17:18:27,787 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 41 [2020-08-21 17:18:27,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:27,787 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2020-08-21 17:18:27,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 17:18:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2020-08-21 17:18:27,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-21 17:18:27,794 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:27,794 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 17:18:27,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 17:18:27,794 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:27,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:27,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 4 times [2020-08-21 17:18:27,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:27,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [572460498] [2020-08-21 17:18:27,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:27,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,192 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 17:18:28,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [572460498] [2020-08-21 17:18:28,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:28,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-21 17:18:28,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837545182] [2020-08-21 17:18:28,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-21 17:18:28,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:28,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-21 17:18:28,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-08-21 17:18:28,195 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 11 states. [2020-08-21 17:18:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:28,543 INFO L93 Difference]: Finished difference Result 107 states and 178 transitions. [2020-08-21 17:18:28,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-21 17:18:28,544 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-08-21 17:18:28,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:28,547 INFO L225 Difference]: With dead ends: 107 [2020-08-21 17:18:28,547 INFO L226 Difference]: Without dead ends: 57 [2020-08-21 17:18:28,549 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 17:18:28,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-21 17:18:28,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-08-21 17:18:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-21 17:18:28,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2020-08-21 17:18:28,560 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 82 [2020-08-21 17:18:28,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:28,561 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2020-08-21 17:18:28,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-21 17:18:28,561 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2020-08-21 17:18:28,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-21 17:18:28,567 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:28,567 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 17:18:28,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 17:18:28,567 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:28,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:28,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1040445716, now seen corresponding path program 5 times [2020-08-21 17:18:28,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:28,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1077329104] [2020-08-21 17:18:28,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:28,961 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 17:18:28,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1077329104] [2020-08-21 17:18:28,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:28,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-21 17:18:28,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916951196] [2020-08-21 17:18:28,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-21 17:18:28,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:28,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-21 17:18:28,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-08-21 17:18:28,965 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand 13 states. [2020-08-21 17:18:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:29,414 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2020-08-21 17:18:29,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-21 17:18:29,415 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 136 [2020-08-21 17:18:29,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:29,421 INFO L225 Difference]: With dead ends: 115 [2020-08-21 17:18:29,422 INFO L226 Difference]: Without dead ends: 74 [2020-08-21 17:18:29,424 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 17:18:29,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-08-21 17:18:29,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2020-08-21 17:18:29,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-21 17:18:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2020-08-21 17:18:29,448 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 136 [2020-08-21 17:18:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:29,449 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2020-08-21 17:18:29,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-21 17:18:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2020-08-21 17:18:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-21 17:18:29,451 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:29,451 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 17:18:29,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-21 17:18:29,452 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:29,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:29,452 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 6 times [2020-08-21 17:18:29,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:29,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1205229414] [2020-08-21 17:18:29,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 17:18:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:29,934 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 17:18:29,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1205229414] [2020-08-21 17:18:29,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:29,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-21 17:18:29,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238195419] [2020-08-21 17:18:29,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 17:18:29,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:29,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 17:18:29,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-21 17:18:29,945 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 10 states. [2020-08-21 17:18:30,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:30,221 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2020-08-21 17:18:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-21 17:18:30,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-21 17:18:30,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:30,231 INFO L225 Difference]: With dead ends: 186 [2020-08-21 17:18:30,231 INFO L226 Difference]: Without dead ends: 182 [2020-08-21 17:18:30,232 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 17:18:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-08-21 17:18:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2020-08-21 17:18:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-08-21 17:18:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2020-08-21 17:18:30,286 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 177 [2020-08-21 17:18:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:30,287 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2020-08-21 17:18:30,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 17:18:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2020-08-21 17:18:30,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-08-21 17:18:30,301 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:30,302 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 17:18:30,302 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-21 17:18:30,302 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:30,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:30,303 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 7 times [2020-08-21 17:18:30,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:30,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [823335131] [2020-08-21 17:18:30,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 17:18:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 17:18:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:30,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 17:18:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:31,463 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 17:18:31,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [823335131] [2020-08-21 17:18:31,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:31,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-21 17:18:31,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244824365] [2020-08-21 17:18:31,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-21 17:18:31,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:31,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-21 17:18:31,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-08-21 17:18:31,466 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand 17 states. [2020-08-21 17:18:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:32,288 INFO L93 Difference]: Finished difference Result 281 states and 495 transitions. [2020-08-21 17:18:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-08-21 17:18:32,289 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 327 [2020-08-21 17:18:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:32,292 INFO L225 Difference]: With dead ends: 281 [2020-08-21 17:18:32,293 INFO L226 Difference]: Without dead ends: 125 [2020-08-21 17:18:32,296 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 17:18:32,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-08-21 17:18:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2020-08-21 17:18:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-08-21 17:18:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2020-08-21 17:18:32,309 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 327 [2020-08-21 17:18:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:32,310 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2020-08-21 17:18:32,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-21 17:18:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2020-08-21 17:18:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2020-08-21 17:18:32,334 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:32,334 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 17:18:32,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-21 17:18:32,335 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:32,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:32,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1569959394, now seen corresponding path program 8 times [2020-08-21 17:18:32,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:32,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1070333639] [2020-08-21 17:18:32,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:32,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:32,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:32,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:32,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 17:18:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 17:18:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-21 17:18:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 17:18:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 17:18:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-08-21 17:18:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:33,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:34,362 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 17:18:34,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1070333639] [2020-08-21 17:18:34,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:34,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-21 17:18:34,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107436695] [2020-08-21 17:18:34,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-21 17:18:34,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:34,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-21 17:18:34,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-08-21 17:18:34,366 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand 19 states. [2020-08-21 17:18:35,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:35,382 INFO L93 Difference]: Finished difference Result 226 states and 393 transitions. [2020-08-21 17:18:35,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-08-21 17:18:35,382 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 599 [2020-08-21 17:18:35,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:35,385 INFO L225 Difference]: With dead ends: 226 [2020-08-21 17:18:35,386 INFO L226 Difference]: Without dead ends: 136 [2020-08-21 17:18:35,388 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=442, Invalid=1814, Unknown=0, NotChecked=0, Total=2256 [2020-08-21 17:18:35,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-08-21 17:18:35,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2020-08-21 17:18:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-08-21 17:18:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2020-08-21 17:18:35,400 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 599 [2020-08-21 17:18:35,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:35,401 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2020-08-21 17:18:35,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-21 17:18:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2020-08-21 17:18:35,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2020-08-21 17:18:35,423 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:35,424 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 17:18:35,424 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-21 17:18:35,424 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:35,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:35,425 INFO L82 PathProgramCache]: Analyzing trace with hash -127293739, now seen corresponding path program 9 times [2020-08-21 17:18:35,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:35,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1072252154] [2020-08-21 17:18:35,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:35,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:35,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 17:18:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 17:18:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:36,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-21 17:18:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 17:18:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-08-21 17:18:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 17:18:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 17:18:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:37,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:38,372 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 17:18:38,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1072252154] [2020-08-21 17:18:38,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:38,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-21 17:18:38,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679064739] [2020-08-21 17:18:38,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-21 17:18:38,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:38,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-21 17:18:38,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-21 17:18:38,375 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand 13 states. [2020-08-21 17:18:38,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:38,737 INFO L93 Difference]: Finished difference Result 486 states and 772 transitions. [2020-08-21 17:18:38,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-21 17:18:38,737 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 749 [2020-08-21 17:18:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:38,749 INFO L225 Difference]: With dead ends: 486 [2020-08-21 17:18:38,749 INFO L226 Difference]: Without dead ends: 482 [2020-08-21 17:18:38,750 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 17:18:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-08-21 17:18:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 461. [2020-08-21 17:18:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-08-21 17:18:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 725 transitions. [2020-08-21 17:18:38,801 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 725 transitions. Word has length 749 [2020-08-21 17:18:38,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:38,802 INFO L479 AbstractCegarLoop]: Abstraction has 461 states and 725 transitions. [2020-08-21 17:18:38,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-21 17:18:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 725 transitions. [2020-08-21 17:18:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-08-21 17:18:38,815 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:38,816 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 17:18:38,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-21 17:18:38,816 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:38,817 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 10 times [2020-08-21 17:18:38,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:38,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [412635849] [2020-08-21 17:18:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-21 17:18:39,502 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-21 17:18:39,502 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-21 17:18:39,514 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-21 17:18:39,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 05:18:39 BoogieIcfgContainer [2020-08-21 17:18:39,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 17:18:39,649 INFO L168 Benchmark]: Toolchain (without parser) took 14606.93 ms. Allocated memory was 140.5 MB in the beginning and 773.3 MB in the end (delta: 632.8 MB). Free memory was 104.3 MB in the beginning and 400.7 MB in the end (delta: -296.4 MB). Peak memory consumption was 652.1 MB. Max. memory is 7.1 GB. [2020-08-21 17:18:39,650 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.6 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-08-21 17:18:39,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.59 ms. Allocated memory is still 140.5 MB. Free memory was 103.9 MB in the beginning and 94.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-08-21 17:18:39,653 INFO L168 Benchmark]: Boogie Preprocessor took 30.16 ms. Allocated memory is still 140.5 MB. Free memory was 94.7 MB in the beginning and 93.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-08-21 17:18:39,653 INFO L168 Benchmark]: RCFGBuilder took 335.29 ms. Allocated memory was 140.5 MB in the beginning and 200.8 MB in the end (delta: 60.3 MB). Free memory was 93.4 MB in the beginning and 168.7 MB in the end (delta: -75.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2020-08-21 17:18:39,654 INFO L168 Benchmark]: TraceAbstraction took 13992.17 ms. Allocated memory was 200.8 MB in the beginning and 773.3 MB in the end (delta: 572.5 MB). Free memory was 167.7 MB in the beginning and 400.7 MB in the end (delta: -233.0 MB). Peak memory consumption was 655.2 MB. Max. memory is 7.1 GB. [2020-08-21 17:18:39,660 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.22 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.6 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 244.59 ms. Allocated memory is still 140.5 MB. Free memory was 103.9 MB in the beginning and 94.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.16 ms. Allocated memory is still 140.5 MB. Free memory was 94.7 MB in the beginning and 93.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 335.29 ms. Allocated memory was 140.5 MB in the beginning and 200.8 MB in the end (delta: 60.3 MB). Free memory was 93.4 MB in the beginning and 168.7 MB in the end (delta: -75.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13992.17 ms. Allocated memory was 200.8 MB in the beginning and 773.3 MB in the end (delta: 572.5 MB). Free memory was 167.7 MB in the beginning and 400.7 MB in the end (delta: -233.0 MB). Peak memory consumption was 655.2 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.7s, 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, 1810 SolverSat, 741 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 898 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 87 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.5s 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...