/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:06:03,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:06:03,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:06:03,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:06:03,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:06:03,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:06:03,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:06:03,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:06:03,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:06:03,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:06:03,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:06:03,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:06:03,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:06:03,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:06:03,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:06:03,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:06:03,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:06:03,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:06:03,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:06:03,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:06:03,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:06:03,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:06:03,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:06:03,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:06:03,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:06:03,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:06:03,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:06:03,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:06:03,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:06:03,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:06:03,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:06:03,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:06:03,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:06:03,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:06:03,811 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:06:03,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:06:03,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:06:03,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:06:03,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:06:03,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:06:03,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:06:03,818 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:06:03,832 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:06:03,832 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:06:03,834 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:06:03,834 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:06:03,835 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:06:03,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:06:03,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:06:03,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:06:03,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:06:03,836 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:06:03,836 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:06:03,836 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:06:03,836 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:06:03,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:06:03,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:06:03,837 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:06:03,837 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:06:03,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:06:03,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:06:03,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:06:03,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:06:03,839 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:06:03,840 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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: Use separate solver for trace checks -> true [2020-11-07 05:06:04,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:06:04,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:06:04,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:06:04,290 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:06:04,291 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:06:04,292 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-11-07 05:06:04,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f3172c1/8412ce92f7fb445285d5866aebc12745/FLAGc8a5e1f80 [2020-11-07 05:06:05,172 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:06:05,173 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-11-07 05:06:05,181 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f3172c1/8412ce92f7fb445285d5866aebc12745/FLAGc8a5e1f80 [2020-11-07 05:06:05,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f3172c1/8412ce92f7fb445285d5866aebc12745 [2020-11-07 05:06:05,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:06:05,550 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:06:05,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:06:05,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:06:05,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:06:05,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:06:05" (1/1) ... [2020-11-07 05:06:05,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@496d4727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:05, skipping insertion in model container [2020-11-07 05:06:05,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:06:05" (1/1) ... [2020-11-07 05:06:05,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:06:05,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:06:05,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:06:05,784 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:06:05,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:06:05,823 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:06:05,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:05 WrapperNode [2020-11-07 05:06:05,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:06:05,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:06:05,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:06:05,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:06:05,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:05" (1/1) ... [2020-11-07 05:06:05,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:05" (1/1) ... [2020-11-07 05:06:05,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:05" (1/1) ... [2020-11-07 05:06:05,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:05" (1/1) ... [2020-11-07 05:06:05,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:05" (1/1) ... [2020-11-07 05:06:05,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:05" (1/1) ... [2020-11-07 05:06:05,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:05" (1/1) ... [2020-11-07 05:06:05,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:06:05,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:06:05,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:06:05,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:06:05,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-11-07 05:06:05,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:06:05,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:06:05,958 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:06:05,958 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-11-07 05:06:05,959 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:06:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:06:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:06:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:06:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:06:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:06:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-11-07 05:06:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:06:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:06:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:06:05,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:06:05,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:06:05,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:06:05,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:06:06,295 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:06:06,295 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:06:06,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:06:06 BoogieIcfgContainer [2020-11-07 05:06:06,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:06:06,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:06:06,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:06:06,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:06:06,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:06:05" (1/3) ... [2020-11-07 05:06:06,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f365cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:06:06, skipping insertion in model container [2020-11-07 05:06:06,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:05" (2/3) ... [2020-11-07 05:06:06,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f365cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:06:06, skipping insertion in model container [2020-11-07 05:06:06,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:06:06" (3/3) ... [2020-11-07 05:06:06,311 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-11-07 05:06:06,334 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:06:06,362 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:06:06,397 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:06:06,441 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:06:06,443 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:06:06,444 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:06:06,444 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:06:06,444 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:06:06,444 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:06:06,444 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:06:06,445 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:06:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-11-07 05:06:06,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:06:06,491 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:06,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:06,494 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:06,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:06,508 INFO L82 PathProgramCache]: Analyzing trace with hash -32329728, now seen corresponding path program 1 times [2020-11-07 05:06:06,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:06,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [897554328] [2020-11-07 05:06:06,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:06:06,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [897554328] [2020-11-07 05:06:06,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:06:06,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:06:06,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081406186] [2020-11-07 05:06:06,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:06:06,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:07,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:06:07,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:06:07,017 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2020-11-07 05:06:07,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:07,522 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-11-07 05:06:07,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:06:07,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:06:07,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:07,535 INFO L225 Difference]: With dead ends: 60 [2020-11-07 05:06:07,536 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 05:06:07,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:06:07,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 05:06:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 05:06:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 05:06:07,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 05:06:07,616 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2020-11-07 05:06:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:07,617 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 05:06:07,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:06:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 05:06:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 05:06:07,620 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:07,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:07,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:06:07,621 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:07,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:07,622 INFO L82 PathProgramCache]: Analyzing trace with hash 950139466, now seen corresponding path program 1 times [2020-11-07 05:06:07,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:07,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1522065937] [2020-11-07 05:06:07,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:06:07,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1522065937] [2020-11-07 05:06:07,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:06:07,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:06:07,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331333067] [2020-11-07 05:06:07,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:06:07,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:07,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:06:07,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:06:07,772 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2020-11-07 05:06:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:08,077 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-11-07 05:06:08,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:06:08,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 05:06:08,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:08,080 INFO L225 Difference]: With dead ends: 46 [2020-11-07 05:06:08,080 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 05:06:08,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:06:08,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 05:06:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-11-07 05:06:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 05:06:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 05:06:08,097 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2020-11-07 05:06:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:08,097 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 05:06:08,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:06:08,098 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 05:06:08,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 05:06:08,100 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:08,100 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:08,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:06:08,100 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:08,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1810718643, now seen corresponding path program 1 times [2020-11-07 05:06:08,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:08,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1731211829] [2020-11-07 05:06:08,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 05:06:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 05:06:08,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1731211829] [2020-11-07 05:06:08,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:08,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:06:08,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909752089] [2020-11-07 05:06:08,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:06:08,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:08,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:06:08,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:06:08,279 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2020-11-07 05:06:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:08,561 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-11-07 05:06:08,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:06:08,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 05:06:08,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:08,563 INFO L225 Difference]: With dead ends: 62 [2020-11-07 05:06:08,564 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 05:06:08,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:06:08,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 05:06:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 05:06:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 05:06:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 05:06:08,580 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 42 [2020-11-07 05:06:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:08,581 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 05:06:08,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:06:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 05:06:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 05:06:08,583 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:08,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:08,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:06:08,584 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:08,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:08,584 INFO L82 PathProgramCache]: Analyzing trace with hash 195045207, now seen corresponding path program 1 times [2020-11-07 05:06:08,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:08,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [54333642] [2020-11-07 05:06:08,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 05:06:08,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [54333642] [2020-11-07 05:06:08,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:08,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:06:08,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241645678] [2020-11-07 05:06:08,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:06:08,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:08,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:06:08,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:06:08,735 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-11-07 05:06:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:09,259 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-11-07 05:06:09,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:06:09,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-11-07 05:06:09,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:09,263 INFO L225 Difference]: With dead ends: 66 [2020-11-07 05:06:09,263 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 05:06:09,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:06:09,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 05:06:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 05:06:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 05:06:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2020-11-07 05:06:09,288 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 43 [2020-11-07 05:06:09,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:09,289 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2020-11-07 05:06:09,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:06:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-11-07 05:06:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 05:06:09,292 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:09,292 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:09,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:06:09,292 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:09,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:09,293 INFO L82 PathProgramCache]: Analyzing trace with hash -396245802, now seen corresponding path program 2 times [2020-11-07 05:06:09,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:09,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [267193799] [2020-11-07 05:06:09,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-07 05:06:09,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [267193799] [2020-11-07 05:06:09,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:09,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:06:09,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241726625] [2020-11-07 05:06:09,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:06:09,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:09,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:06:09,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:06:09,562 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 8 states. [2020-11-07 05:06:10,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:10,137 INFO L93 Difference]: Finished difference Result 118 states and 161 transitions. [2020-11-07 05:06:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:06:10,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 05:06:10,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:10,141 INFO L225 Difference]: With dead ends: 118 [2020-11-07 05:06:10,141 INFO L226 Difference]: Without dead ends: 73 [2020-11-07 05:06:10,143 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:06:10,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-07 05:06:10,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-11-07 05:06:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 05:06:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-11-07 05:06:10,169 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 60 [2020-11-07 05:06:10,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:10,170 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-11-07 05:06:10,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:06:10,170 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-11-07 05:06:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 05:06:10,174 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:10,175 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:10,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:06:10,175 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:10,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:10,177 INFO L82 PathProgramCache]: Analyzing trace with hash -13012784, now seen corresponding path program 3 times [2020-11-07 05:06:10,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:10,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1065729627] [2020-11-07 05:06:10,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:10,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:10,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:10,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:10,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:10,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:10,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-07 05:06:10,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1065729627] [2020-11-07 05:06:10,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:10,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:06:10,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860752693] [2020-11-07 05:06:10,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:06:10,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:10,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:06:10,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:06:10,424 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2020-11-07 05:06:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:10,982 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2020-11-07 05:06:10,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 05:06:10,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-11-07 05:06:10,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:10,992 INFO L225 Difference]: With dead ends: 96 [2020-11-07 05:06:10,992 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 05:06:10,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:06:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 05:06:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2020-11-07 05:06:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-07 05:06:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2020-11-07 05:06:11,053 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 61 [2020-11-07 05:06:11,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:11,053 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2020-11-07 05:06:11,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:06:11,054 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2020-11-07 05:06:11,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 05:06:11,057 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:11,057 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:11,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:06:11,058 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:11,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:11,059 INFO L82 PathProgramCache]: Analyzing trace with hash 159854214, now seen corresponding path program 4 times [2020-11-07 05:06:11,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:11,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [19932271] [2020-11-07 05:06:11,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:11,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:11,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:11,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:11,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:11,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:11,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:11,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:11,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:11,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:11,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:11,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:11,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:11,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:11,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 36 proven. 197 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2020-11-07 05:06:11,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [19932271] [2020-11-07 05:06:11,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:11,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:06:11,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131632166] [2020-11-07 05:06:11,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:06:11,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:11,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:06:11,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:06:11,578 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand 9 states. [2020-11-07 05:06:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:12,251 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2020-11-07 05:06:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:06:12,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2020-11-07 05:06:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:12,266 INFO L225 Difference]: With dead ends: 146 [2020-11-07 05:06:12,266 INFO L226 Difference]: Without dead ends: 139 [2020-11-07 05:06:12,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:06:12,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-07 05:06:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2020-11-07 05:06:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 05:06:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2020-11-07 05:06:12,348 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 132 [2020-11-07 05:06:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:12,349 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2020-11-07 05:06:12,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:06:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2020-11-07 05:06:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-11-07 05:06:12,356 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:12,357 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:12,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:06:12,358 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:12,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:12,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1497778840, now seen corresponding path program 5 times [2020-11-07 05:06:12,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:12,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2065841466] [2020-11-07 05:06:12,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 78 proven. 452 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2020-11-07 05:06:13,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2065841466] [2020-11-07 05:06:13,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:13,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:06:13,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062065814] [2020-11-07 05:06:13,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:06:13,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:13,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:06:13,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:06:13,143 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand 10 states. [2020-11-07 05:06:13,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:13,967 INFO L93 Difference]: Finished difference Result 240 states and 348 transitions. [2020-11-07 05:06:13,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:06:13,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 202 [2020-11-07 05:06:13,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:13,975 INFO L225 Difference]: With dead ends: 240 [2020-11-07 05:06:13,976 INFO L226 Difference]: Without dead ends: 233 [2020-11-07 05:06:13,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:06:13,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-11-07 05:06:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 215. [2020-11-07 05:06:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-11-07 05:06:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2020-11-07 05:06:14,057 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 202 [2020-11-07 05:06:14,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:14,058 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2020-11-07 05:06:14,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:06:14,058 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2020-11-07 05:06:14,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-11-07 05:06:14,064 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:14,064 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:14,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:06:14,065 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:14,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:14,066 INFO L82 PathProgramCache]: Analyzing trace with hash -509020704, now seen corresponding path program 6 times [2020-11-07 05:06:14,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:14,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [713083651] [2020-11-07 05:06:14,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:06:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 126 proven. 642 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2020-11-07 05:06:14,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [713083651] [2020-11-07 05:06:14,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:14,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:06:14,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285997898] [2020-11-07 05:06:14,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:06:14,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:14,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:06:14,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:06:14,744 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand 11 states. [2020-11-07 05:06:15,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:15,787 INFO L93 Difference]: Finished difference Result 422 states and 653 transitions. [2020-11-07 05:06:15,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 05:06:15,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 237 [2020-11-07 05:06:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:15,801 INFO L225 Difference]: With dead ends: 422 [2020-11-07 05:06:15,801 INFO L226 Difference]: Without dead ends: 415 [2020-11-07 05:06:15,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:06:15,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-11-07 05:06:15,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 391. [2020-11-07 05:06:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-11-07 05:06:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 617 transitions. [2020-11-07 05:06:15,893 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 617 transitions. Word has length 237 [2020-11-07 05:06:15,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:15,894 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 617 transitions. [2020-11-07 05:06:15,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:06:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 617 transitions. [2020-11-07 05:06:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2020-11-07 05:06:15,906 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:15,907 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 15, 15, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:15,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:06:15,908 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:15,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:15,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1781154385, now seen corresponding path program 7 times [2020-11-07 05:06:15,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:15,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1206907491] [2020-11-07 05:06:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:06:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 05:06:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:16,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:06:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6939 backedges. 1724 proven. 1617 refuted. 0 times theorem prover too weak. 3598 trivial. 0 not checked. [2020-11-07 05:06:17,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1206907491] [2020-11-07 05:06:17,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:17,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 05:06:17,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842347402] [2020-11-07 05:06:17,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 05:06:17,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:17,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 05:06:17,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2020-11-07 05:06:17,413 INFO L87 Difference]: Start difference. First operand 391 states and 617 transitions. Second operand 18 states. [2020-11-07 05:06:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:20,446 INFO L93 Difference]: Finished difference Result 533 states and 935 transitions. [2020-11-07 05:06:20,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-07 05:06:20,447 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 431 [2020-11-07 05:06:20,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:20,451 INFO L225 Difference]: With dead ends: 533 [2020-11-07 05:06:20,451 INFO L226 Difference]: Without dead ends: 155 [2020-11-07 05:06:20,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=477, Invalid=1875, Unknown=0, NotChecked=0, Total=2352 [2020-11-07 05:06:20,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-11-07 05:06:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 124. [2020-11-07 05:06:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 05:06:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 159 transitions. [2020-11-07 05:06:20,484 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 159 transitions. Word has length 431 [2020-11-07 05:06:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:20,485 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 159 transitions. [2020-11-07 05:06:20,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 05:06:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 159 transitions. [2020-11-07 05:06:20,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2020-11-07 05:06:20,493 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:20,494 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:20,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:06:20,494 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:20,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:20,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1553933834, now seen corresponding path program 8 times [2020-11-07 05:06:20,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:20,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [723086414] [2020-11-07 05:06:20,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:06:20,553 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:06:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:06:20,613 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:06:20,788 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:06:20,789 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:06:20,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:06:20,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:06:20 BoogieIcfgContainer [2020-11-07 05:06:20,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:06:20,973 INFO L168 Benchmark]: Toolchain (without parser) took 15426.66 ms. Allocated memory was 153.1 MB in the beginning and 437.3 MB in the end (delta: 284.2 MB). Free memory was 129.3 MB in the beginning and 161.8 MB in the end (delta: -32.5 MB). Peak memory consumption was 252.7 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:20,974 INFO L168 Benchmark]: CDTParser took 5.03 ms. Allocated memory is still 153.1 MB. Free memory is still 125.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:06:20,974 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.61 ms. Allocated memory is still 153.1 MB. Free memory was 128.8 MB in the beginning and 119.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:20,975 INFO L168 Benchmark]: Boogie Preprocessor took 38.42 ms. Allocated memory is still 153.1 MB. Free memory was 119.2 MB in the beginning and 117.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:20,976 INFO L168 Benchmark]: RCFGBuilder took 433.73 ms. Allocated memory is still 153.1 MB. Free memory was 117.7 MB in the beginning and 104.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:20,977 INFO L168 Benchmark]: TraceAbstraction took 14669.27 ms. Allocated memory was 153.1 MB in the beginning and 437.3 MB in the end (delta: 284.2 MB). Free memory was 103.8 MB in the beginning and 161.8 MB in the end (delta: -58.0 MB). Peak memory consumption was 227.5 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:20,981 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 5.03 ms. Allocated memory is still 153.1 MB. Free memory is still 125.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 271.61 ms. Allocated memory is still 153.1 MB. Free memory was 128.8 MB in the beginning and 119.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 38.42 ms. Allocated memory is still 153.1 MB. Free memory was 119.2 MB in the beginning and 117.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 433.73 ms. Allocated memory is still 153.1 MB. Free memory was 117.7 MB in the beginning and 104.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 14669.27 ms. Allocated memory was 153.1 MB in the beginning and 437.3 MB in the end (delta: 284.2 MB). Free memory was 103.8 MB in the beginning and 161.8 MB in the end (delta: -58.0 MB). Peak memory consumption was 227.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = 7; VAL [x=7] [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=7, \result=13, fibo(n-1)=8, fibo(n-2)=5, n=7] [L27] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L27] int result = fibo(x); VAL [fibo(x)=13, result=13, x=7] [L28] COND TRUE result == 13 VAL [result=13, x=7] [L29] CALL reach_error() [L4] __assert_fail("0", "fibo_7-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.3s, OverallIterations: 11, TraceHistogramMax: 47, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 398 SDtfs, 880 SDslu, 572 SDs, 0 SdLazy, 1603 SolverSat, 585 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 105 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1637 NumberOfCodeBlocks, 1637 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1249 ConstructedInterpolants, 0 QuantifiedInterpolants, 533647 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 7808/10761 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...