/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=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.1 --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-22 03:00:26,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 03:00:26,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 03:00:26,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 03:00:26,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 03:00:26,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 03:00:26,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 03:00:26,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 03:00:26,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 03:00:26,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 03:00:26,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 03:00:26,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 03:00:26,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 03:00:26,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 03:00:26,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 03:00:26,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 03:00:26,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 03:00:26,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 03:00:26,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 03:00:26,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 03:00:26,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 03:00:26,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 03:00:26,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 03:00:26,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 03:00:26,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 03:00:26,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 03:00:26,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 03:00:26,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 03:00:26,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 03:00:26,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 03:00:26,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 03:00:26,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 03:00:26,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 03:00:26,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 03:00:26,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 03:00:26,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 03:00:26,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 03:00:26,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 03:00:26,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 03:00:26,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 03:00:26,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 03:00:26,966 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-22 03:00:27,002 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 03:00:27,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 03:00:27,003 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 03:00:27,003 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 03:00:27,004 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 03:00:27,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 03:00:27,004 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 03:00:27,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 03:00:27,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 03:00:27,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 03:00:27,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 03:00:27,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 03:00:27,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 03:00:27,005 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 03:00:27,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 03:00:27,006 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 03:00:27,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 03:00:27,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 03:00:27,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 03:00:27,007 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 03:00:27,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 03:00:27,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 03:00:27,007 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 03:00:27,007 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 03:00:27,007 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 03:00:27,008 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 03:00:27,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 03:00:27,008 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 03:00:27,008 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 03:00:27,008 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=SMALLESTAMONGWIDE;tolerance=0.1;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.1;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.1;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.1;log-additional-information=true; [2020-08-22 03:00:27,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 03:00:27,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 03:00:27,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 03:00:27,353 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 03:00:27,354 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 03:00:27,355 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-22 03:00:27,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e9926529c/e25deb981f5d4692ad5dabb05f5bfe2d/FLAGd7e78ac77 [2020-08-22 03:00:27,868 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 03:00:27,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-22 03:00:27,875 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e9926529c/e25deb981f5d4692ad5dabb05f5bfe2d/FLAGd7e78ac77 [2020-08-22 03:00:28,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e9926529c/e25deb981f5d4692ad5dabb05f5bfe2d [2020-08-22 03:00:28,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 03:00:28,308 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 03:00:28,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 03:00:28,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 03:00:28,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 03:00:28,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 03:00:28" (1/1) ... [2020-08-22 03:00:28,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@522d3de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:28, skipping insertion in model container [2020-08-22 03:00:28,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 03:00:28" (1/1) ... [2020-08-22 03:00:28,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 03:00:28,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 03:00:28,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 03:00:28,541 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 03:00:28,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 03:00:28,572 INFO L208 MainTranslator]: Completed translation [2020-08-22 03:00:28,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:28 WrapperNode [2020-08-22 03:00:28,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 03:00:28,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 03:00:28,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 03:00:28,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 03:00:28,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:28" (1/1) ... [2020-08-22 03:00:28,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:28" (1/1) ... [2020-08-22 03:00:28,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:28" (1/1) ... [2020-08-22 03:00:28,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:28" (1/1) ... [2020-08-22 03:00:28,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:28" (1/1) ... [2020-08-22 03:00:28,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:28" (1/1) ... [2020-08-22 03:00:28,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:28" (1/1) ... [2020-08-22 03:00:28,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 03:00:28,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 03:00:28,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 03:00:28,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 03:00:28,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:28" (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-22 03:00:28,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 03:00:28,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 03:00:28,736 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-08-22 03:00:28,736 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 03:00:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 03:00:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 03:00:28,737 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-08-22 03:00:28,737 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 03:00:28,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 03:00:28,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 03:00:28,910 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 03:00:28,911 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 03:00:28,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 03:00:28 BoogieIcfgContainer [2020-08-22 03:00:28,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 03:00:28,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 03:00:28,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 03:00:28,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 03:00:28,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 03:00:28" (1/3) ... [2020-08-22 03:00:28,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2ded99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 03:00:28, skipping insertion in model container [2020-08-22 03:00:28,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:00:28" (2/3) ... [2020-08-22 03:00:28,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2ded99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 03:00:28, skipping insertion in model container [2020-08-22 03:00:28,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 03:00:28" (3/3) ... [2020-08-22 03:00:28,923 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-08-22 03:00:28,934 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 03:00:28,944 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 03:00:28,959 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 03:00:28,987 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 03:00:28,988 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 03:00:28,988 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 03:00:28,988 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 03:00:28,989 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 03:00:28,989 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 03:00:28,989 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 03:00:28,990 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 03:00:29,017 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-08-22 03:00:29,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-22 03:00:29,025 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:29,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:00:29,027 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:29,036 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-08-22 03:00:29,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:29,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1236275277] [2020-08-22 03:00:29,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:29,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:29,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 03:00:29,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1236275277] [2020-08-22 03:00:29,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 03:00:29,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 03:00:29,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344477836] [2020-08-22 03:00:29,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 03:00:29,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:29,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 03:00:29,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 03:00:29,299 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-08-22 03:00:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:29,388 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-22 03:00:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 03:00:29,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-22 03:00:29,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:29,402 INFO L225 Difference]: With dead ends: 35 [2020-08-22 03:00:29,402 INFO L226 Difference]: Without dead ends: 21 [2020-08-22 03:00:29,406 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 03:00:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-22 03:00:29,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-22 03:00:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 03:00:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 03:00:29,449 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-22 03:00:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:29,449 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 03:00:29,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 03:00:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 03:00:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-22 03:00:29,452 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:29,452 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:00:29,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 03:00:29,453 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:29,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:29,453 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-08-22 03:00:29,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:29,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [938840838] [2020-08-22 03:00:29,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:29,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:29,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 03:00:29,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [938840838] [2020-08-22 03:00:29,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 03:00:29,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 03:00:29,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15184727] [2020-08-22 03:00:29,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 03:00:29,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:29,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 03:00:29,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 03:00:29,535 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-22 03:00:29,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:29,598 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-22 03:00:29,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 03:00:29,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-22 03:00:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:29,601 INFO L225 Difference]: With dead ends: 27 [2020-08-22 03:00:29,601 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 03:00:29,602 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 03:00:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 03:00:29,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-22 03:00:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 03:00:29,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 03:00:29,610 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-22 03:00:29,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:29,611 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 03:00:29,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 03:00:29,611 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 03:00:29,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-22 03:00:29,613 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:29,613 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-22 03:00:29,613 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 03:00:29,614 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:29,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:29,614 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-08-22 03:00:29,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:29,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1982996900] [2020-08-22 03:00:29,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:29,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:29,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:29,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:29,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-22 03:00:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:29,819 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-22 03:00:29,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1982996900] [2020-08-22 03:00:29,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:29,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 03:00:29,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787569467] [2020-08-22 03:00:29,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 03:00:29,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:29,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 03:00:29,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 03:00:29,824 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states. [2020-08-22 03:00:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:29,939 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-22 03:00:29,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 03:00:29,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-08-22 03:00:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:29,941 INFO L225 Difference]: With dead ends: 38 [2020-08-22 03:00:29,942 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 03:00:29,943 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-22 03:00:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 03:00:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-22 03:00:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-22 03:00:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-22 03:00:29,951 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-22 03:00:29,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:29,952 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-22 03:00:29,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 03:00:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-22 03:00:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-22 03:00:29,954 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:29,954 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-22 03:00:29,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 03:00:29,955 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:29,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:29,955 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-08-22 03:00:29,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:29,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2084105980] [2020-08-22 03:00:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:29,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:29,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,058 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-22 03:00:30,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2084105980] [2020-08-22 03:00:30,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:30,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 03:00:30,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027674562] [2020-08-22 03:00:30,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 03:00:30,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:30,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 03:00:30,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 03:00:30,061 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-22 03:00:30,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:30,185 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-22 03:00:30,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 03:00:30,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-22 03:00:30,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:30,188 INFO L225 Difference]: With dead ends: 41 [2020-08-22 03:00:30,188 INFO L226 Difference]: Without dead ends: 37 [2020-08-22 03:00:30,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-22 03:00:30,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-22 03:00:30,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-22 03:00:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-22 03:00:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-22 03:00:30,201 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-22 03:00:30,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:30,202 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-22 03:00:30,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 03:00:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-22 03:00:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-22 03:00:30,204 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:30,205 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-22 03:00:30,205 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 03:00:30,205 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:30,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:30,206 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-08-22 03:00:30,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:30,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1303899601] [2020-08-22 03:00:30,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,417 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-22 03:00:30,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1303899601] [2020-08-22 03:00:30,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:30,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 03:00:30,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83274961] [2020-08-22 03:00:30,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 03:00:30,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:30,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 03:00:30,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 03:00:30,420 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 8 states. [2020-08-22 03:00:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:30,598 INFO L93 Difference]: Finished difference Result 79 states and 124 transitions. [2020-08-22 03:00:30,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 03:00:30,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-08-22 03:00:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:30,604 INFO L225 Difference]: With dead ends: 79 [2020-08-22 03:00:30,604 INFO L226 Difference]: Without dead ends: 48 [2020-08-22 03:00:30,609 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-22 03:00:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-22 03:00:30,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-08-22 03:00:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-22 03:00:30,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2020-08-22 03:00:30,638 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 40 [2020-08-22 03:00:30,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:30,638 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-08-22 03:00:30,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 03:00:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2020-08-22 03:00:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-22 03:00:30,647 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:30,648 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-22 03:00:30,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 03:00:30,648 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:30,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:30,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 3 times [2020-08-22 03:00:30,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:30,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1381245609] [2020-08-22 03:00:30,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,806 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-22 03:00:30,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1381245609] [2020-08-22 03:00:30,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:30,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 03:00:30,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872833425] [2020-08-22 03:00:30,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 03:00:30,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:30,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 03:00:30,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 03:00:30,809 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand 7 states. [2020-08-22 03:00:30,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:30,926 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2020-08-22 03:00:30,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 03:00:30,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-22 03:00:30,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:30,929 INFO L225 Difference]: With dead ends: 65 [2020-08-22 03:00:30,929 INFO L226 Difference]: Without dead ends: 61 [2020-08-22 03:00:30,930 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 03:00:30,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-08-22 03:00:30,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-08-22 03:00:30,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-08-22 03:00:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2020-08-22 03:00:30,949 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 41 [2020-08-22 03:00:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:30,949 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2020-08-22 03:00:30,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 03:00:30,950 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2020-08-22 03:00:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-22 03:00:30,953 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:30,954 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-22 03:00:30,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 03:00:30,954 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:30,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 4 times [2020-08-22 03:00:30,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:30,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1932262407] [2020-08-22 03:00:30,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:30,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,238 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-22 03:00:31,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1932262407] [2020-08-22 03:00:31,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:31,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 03:00:31,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959880929] [2020-08-22 03:00:31,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 03:00:31,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:31,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 03:00:31,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-08-22 03:00:31,241 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 11 states. [2020-08-22 03:00:31,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:31,571 INFO L93 Difference]: Finished difference Result 107 states and 178 transitions. [2020-08-22 03:00:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 03:00:31,572 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-08-22 03:00:31,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:31,575 INFO L225 Difference]: With dead ends: 107 [2020-08-22 03:00:31,575 INFO L226 Difference]: Without dead ends: 57 [2020-08-22 03:00:31,578 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-22 03:00:31,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-22 03:00:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-08-22 03:00:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-22 03:00:31,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2020-08-22 03:00:31,589 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 82 [2020-08-22 03:00:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:31,589 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2020-08-22 03:00:31,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 03:00:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2020-08-22 03:00:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-22 03:00:31,593 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:31,594 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-22 03:00:31,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 03:00:31,594 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:31,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1040445716, now seen corresponding path program 5 times [2020-08-22 03:00:31,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:31,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [711717755] [2020-08-22 03:00:31,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:31,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,047 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-22 03:00:32,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [711717755] [2020-08-22 03:00:32,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:32,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-22 03:00:32,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300678222] [2020-08-22 03:00:32,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 03:00:32,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:32,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 03:00:32,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-08-22 03:00:32,052 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand 13 states. [2020-08-22 03:00:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:32,550 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2020-08-22 03:00:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 03:00:32,551 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 136 [2020-08-22 03:00:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:32,567 INFO L225 Difference]: With dead ends: 115 [2020-08-22 03:00:32,567 INFO L226 Difference]: Without dead ends: 74 [2020-08-22 03:00:32,570 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-22 03:00:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-08-22 03:00:32,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2020-08-22 03:00:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-22 03:00:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2020-08-22 03:00:32,582 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 136 [2020-08-22 03:00:32,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:32,582 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2020-08-22 03:00:32,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 03:00:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2020-08-22 03:00:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-22 03:00:32,588 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:32,589 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-22 03:00:32,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 03:00:32,589 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:32,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:32,589 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 6 times [2020-08-22 03:00:32,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:32,593 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1299580400] [2020-08-22 03:00:32,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 03:00:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:32,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,039 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-22 03:00:33,039 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1299580400] [2020-08-22 03:00:33,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:33,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 03:00:33,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832964383] [2020-08-22 03:00:33,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 03:00:33,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:33,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 03:00:33,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 03:00:33,042 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 10 states. [2020-08-22 03:00:33,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:33,263 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2020-08-22 03:00:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 03:00:33,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-22 03:00:33,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:33,272 INFO L225 Difference]: With dead ends: 186 [2020-08-22 03:00:33,272 INFO L226 Difference]: Without dead ends: 182 [2020-08-22 03:00:33,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-22 03:00:33,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-08-22 03:00:33,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2020-08-22 03:00:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-08-22 03:00:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2020-08-22 03:00:33,321 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 177 [2020-08-22 03:00:33,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:33,323 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2020-08-22 03:00:33,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 03:00:33,323 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2020-08-22 03:00:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-08-22 03:00:33,332 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:33,332 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-22 03:00:33,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 03:00:33,333 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:33,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:33,333 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 7 times [2020-08-22 03:00:33,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:33,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1615787596] [2020-08-22 03:00:33,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 03:00:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 03:00:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:33,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 03:00:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:34,365 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-22 03:00:34,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1615787596] [2020-08-22 03:00:34,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:34,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-22 03:00:34,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630442438] [2020-08-22 03:00:34,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-22 03:00:34,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:34,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-22 03:00:34,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-08-22 03:00:34,369 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand 17 states. [2020-08-22 03:00:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:35,203 INFO L93 Difference]: Finished difference Result 281 states and 495 transitions. [2020-08-22 03:00:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-08-22 03:00:35,204 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 327 [2020-08-22 03:00:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:35,207 INFO L225 Difference]: With dead ends: 281 [2020-08-22 03:00:35,208 INFO L226 Difference]: Without dead ends: 125 [2020-08-22 03:00:35,226 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-22 03:00:35,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-08-22 03:00:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2020-08-22 03:00:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-08-22 03:00:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2020-08-22 03:00:35,238 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 327 [2020-08-22 03:00:35,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:35,239 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2020-08-22 03:00:35,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-22 03:00:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2020-08-22 03:00:35,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2020-08-22 03:00:35,258 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:35,259 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-22 03:00:35,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 03:00:35,259 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:35,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:35,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1569959394, now seen corresponding path program 8 times [2020-08-22 03:00:35,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:35,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1739514776] [2020-08-22 03:00:35,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:35,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:35,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:35,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:35,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:35,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 03:00:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 03:00:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-22 03:00:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 03:00:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 03:00:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-08-22 03:00:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:36,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:37,342 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-22 03:00:37,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1739514776] [2020-08-22 03:00:37,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:37,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-22 03:00:37,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332516388] [2020-08-22 03:00:37,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-22 03:00:37,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:37,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-22 03:00:37,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-08-22 03:00:37,345 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand 19 states. [2020-08-22 03:00:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:38,342 INFO L93 Difference]: Finished difference Result 226 states and 393 transitions. [2020-08-22 03:00:38,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-08-22 03:00:38,342 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 599 [2020-08-22 03:00:38,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:38,346 INFO L225 Difference]: With dead ends: 226 [2020-08-22 03:00:38,347 INFO L226 Difference]: Without dead ends: 136 [2020-08-22 03:00:38,349 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=442, Invalid=1814, Unknown=0, NotChecked=0, Total=2256 [2020-08-22 03:00:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-08-22 03:00:38,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2020-08-22 03:00:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-08-22 03:00:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2020-08-22 03:00:38,361 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 599 [2020-08-22 03:00:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:38,362 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2020-08-22 03:00:38,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-22 03:00:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2020-08-22 03:00:38,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2020-08-22 03:00:38,383 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:38,384 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-22 03:00:38,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 03:00:38,384 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:38,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:38,385 INFO L82 PathProgramCache]: Analyzing trace with hash -127293739, now seen corresponding path program 9 times [2020-08-22 03:00:38,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:38,386 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [854115714] [2020-08-22 03:00:38,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:38,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:00:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:38,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:00:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 03:00:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 03:00:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:39,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-22 03:00:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 03:00:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-08-22 03:00:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 03:00:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 03:00:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:00:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:00:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:00:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:00:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:40,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:00:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:00:41,216 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-22 03:00:41,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [854115714] [2020-08-22 03:00:41,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:00:41,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-22 03:00:41,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473470221] [2020-08-22 03:00:41,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 03:00:41,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:00:41,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 03:00:41,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-22 03:00:41,219 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand 13 states. [2020-08-22 03:00:41,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:00:41,590 INFO L93 Difference]: Finished difference Result 486 states and 772 transitions. [2020-08-22 03:00:41,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-22 03:00:41,591 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 749 [2020-08-22 03:00:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:00:41,606 INFO L225 Difference]: With dead ends: 486 [2020-08-22 03:00:41,606 INFO L226 Difference]: Without dead ends: 482 [2020-08-22 03:00:41,608 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-22 03:00:41,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-08-22 03:00:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 461. [2020-08-22 03:00:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-08-22 03:00:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 725 transitions. [2020-08-22 03:00:41,670 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 725 transitions. Word has length 749 [2020-08-22 03:00:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:00:41,671 INFO L479 AbstractCegarLoop]: Abstraction has 461 states and 725 transitions. [2020-08-22 03:00:41,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 03:00:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 725 transitions. [2020-08-22 03:00:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-08-22 03:00:41,689 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:00:41,690 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-22 03:00:41,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 03:00:41,690 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:00:41,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:00:41,691 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 10 times [2020-08-22 03:00:41,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:00:41,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [558206419] [2020-08-22 03:00:41,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:00:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 03:00:42,444 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-22 03:00:42,444 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 03:00:42,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 03:00:42,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 03:00:42 BoogieIcfgContainer [2020-08-22 03:00:42,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 03:00:42,597 INFO L168 Benchmark]: Toolchain (without parser) took 14284.41 ms. Allocated memory was 140.5 MB in the beginning and 802.7 MB in the end (delta: 662.2 MB). Free memory was 103.0 MB in the beginning and 551.2 MB in the end (delta: -448.2 MB). Peak memory consumption was 680.7 MB. Max. memory is 7.1 GB. [2020-08-22 03:00:42,598 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-22 03:00:42,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.74 ms. Allocated memory is still 140.5 MB. Free memory was 102.8 MB in the beginning and 93.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-22 03:00:42,600 INFO L168 Benchmark]: Boogie Preprocessor took 22.93 ms. Allocated memory is still 140.5 MB. Free memory was 93.5 MB in the beginning and 92.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-08-22 03:00:42,601 INFO L168 Benchmark]: RCFGBuilder took 317.11 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 92.1 MB in the beginning and 171.0 MB in the end (delta: -78.8 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2020-08-22 03:00:42,609 INFO L168 Benchmark]: TraceAbstraction took 13674.17 ms. Allocated memory was 203.4 MB in the beginning and 802.7 MB in the end (delta: 599.3 MB). Free memory was 170.3 MB in the beginning and 551.2 MB in the end (delta: -380.9 MB). Peak memory consumption was 685.1 MB. Max. memory is 7.1 GB. [2020-08-22 03:00:42,617 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.33 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 264.74 ms. Allocated memory is still 140.5 MB. Free memory was 102.8 MB in the beginning and 93.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.93 ms. Allocated memory is still 140.5 MB. Free memory was 93.5 MB in the beginning and 92.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 317.11 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 92.1 MB in the beginning and 171.0 MB in the end (delta: -78.8 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13674.17 ms. Allocated memory was 203.4 MB in the beginning and 802.7 MB in the end (delta: 599.3 MB). Free memory was 170.3 MB in the beginning and 551.2 MB in the end (delta: -380.9 MB). Peak memory consumption was 685.1 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.4s, OverallIterations: 13, TraceHistogramMax: 177, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 271 SDtfs, 753 SDslu, 879 SDs, 0 SdLazy, 1814 SolverSat, 740 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 898 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 87 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.2s 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...