/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/Fibonacci01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:37:51,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:37:51,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:37:51,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:37:51,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:37:51,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:37:51,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:37:51,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:37:51,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:37:51,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:37:51,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:37:51,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:37:51,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:37:51,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:37:51,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:37:51,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:37:51,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:37:51,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:37:51,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:37:51,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:37:51,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:37:51,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:37:51,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:37:51,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:37:51,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:37:51,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:37:51,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:37:51,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:37:51,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:37:51,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:37:51,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:37:51,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:37:51,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:37:51,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:37:51,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:37:51,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:37:51,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:37:51,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:37:51,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:37:51,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:37:51,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:37:51,269 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:37:51,291 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:37:51,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:37:51,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:37:51,296 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:37:51,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:37:51,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:37:51,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:37:51,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:37:51,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:37:51,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:37:51,298 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:37:51,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:37:51,298 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:37:51,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:37:51,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:37:51,299 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:37:51,300 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:37:51,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:37:51,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:37:51,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:37:51,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:37:51,300 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:37:51,301 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-10-24 00:37:51,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:37:51,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:37:51,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:37:51,709 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:37:51,710 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:37:51,711 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-10-24 00:37:51,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce401593/77a1bc532bba4fce9b59be6ed92b1c1a/FLAG42ec8b33e [2020-10-24 00:37:52,507 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:37:52,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-10-24 00:37:52,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce401593/77a1bc532bba4fce9b59be6ed92b1c1a/FLAG42ec8b33e [2020-10-24 00:37:52,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce401593/77a1bc532bba4fce9b59be6ed92b1c1a [2020-10-24 00:37:52,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:37:52,889 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:37:52,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:37:52,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:37:52,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:37:52,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:37:52" (1/1) ... [2020-10-24 00:37:52,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@213e5090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:52, skipping insertion in model container [2020-10-24 00:37:52,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:37:52" (1/1) ... [2020-10-24 00:37:52,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:37:52,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:37:53,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:37:53,097 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:37:53,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:37:53,132 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:37:53,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:53 WrapperNode [2020-10-24 00:37:53,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:37:53,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:37:53,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:37:53,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:37:53,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:53" (1/1) ... [2020-10-24 00:37:53,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:53" (1/1) ... [2020-10-24 00:37:53,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:53" (1/1) ... [2020-10-24 00:37:53,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:53" (1/1) ... [2020-10-24 00:37:53,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:53" (1/1) ... [2020-10-24 00:37:53,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:53" (1/1) ... [2020-10-24 00:37:53,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:53" (1/1) ... [2020-10-24 00:37:53,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:37:53,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:37:53,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:37:53,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:37:53,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:53" (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-10-24 00:37:53,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:37:53,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:37:53,259 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:37:53,259 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-10-24 00:37:53,259 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:37:53,259 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:37:53,259 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:37:53,259 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:37:53,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:37:53,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:37:53,260 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-10-24 00:37:53,260 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:37:53,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:37:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:37:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:37:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:37:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:37:53,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:37:53,593 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:37:53,594 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:37:53,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:37:53 BoogieIcfgContainer [2020-10-24 00:37:53,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:37:53,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:37:53,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:37:53,623 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:37:53,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:37:52" (1/3) ... [2020-10-24 00:37:53,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675142c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:37:53, skipping insertion in model container [2020-10-24 00:37:53,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:53" (2/3) ... [2020-10-24 00:37:53,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675142c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:37:53, skipping insertion in model container [2020-10-24 00:37:53,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:37:53" (3/3) ... [2020-10-24 00:37:53,628 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2020-10-24 00:37:53,641 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:37:53,646 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:37:53,662 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:37:53,700 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:37:53,702 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:37:53,702 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:37:53,702 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:37:53,703 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:37:53,703 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:37:53,703 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:37:53,703 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:37:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-10-24 00:37:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-24 00:37:53,745 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:53,747 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, 1, 1] [2020-10-24 00:37:53,747 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:53,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:53,764 INFO L82 PathProgramCache]: Analyzing trace with hash 274389233, now seen corresponding path program 1 times [2020-10-24 00:37:53,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:53,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [886415877] [2020-10-24 00:37:53,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:54,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:54,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 00:37:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:37:54,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [886415877] [2020-10-24 00:37:54,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:37:54,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-24 00:37:54,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642984140] [2020-10-24 00:37:54,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:37:54,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:54,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:37:54,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:37:54,431 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 8 states. [2020-10-24 00:37:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:54,976 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2020-10-24 00:37:54,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:37:54,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-10-24 00:37:54,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:54,988 INFO L225 Difference]: With dead ends: 63 [2020-10-24 00:37:54,989 INFO L226 Difference]: Without dead ends: 40 [2020-10-24 00:37:54,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:37:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-10-24 00:37:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-10-24 00:37:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-24 00:37:55,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-10-24 00:37:55,048 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 28 [2020-10-24 00:37:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:55,048 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-10-24 00:37:55,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:37:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-10-24 00:37:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-24 00:37:55,051 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:55,051 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, 1, 1, 1] [2020-10-24 00:37:55,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:37:55,052 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:55,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:55,053 INFO L82 PathProgramCache]: Analyzing trace with hash -393682023, now seen corresponding path program 1 times [2020-10-24 00:37:55,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:55,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1570511264] [2020-10-24 00:37:55,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:55,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:55,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 00:37:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:37:55,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1570511264] [2020-10-24 00:37:55,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:37:55,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-24 00:37:55,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529977583] [2020-10-24 00:37:55,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:37:55,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:55,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:37:55,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:37:55,220 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 8 states. [2020-10-24 00:37:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:55,599 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-10-24 00:37:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:37:55,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-10-24 00:37:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:55,602 INFO L225 Difference]: With dead ends: 49 [2020-10-24 00:37:55,602 INFO L226 Difference]: Without dead ends: 42 [2020-10-24 00:37:55,603 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:37:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-24 00:37:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-10-24 00:37:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-24 00:37:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-10-24 00:37:55,619 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 29 [2020-10-24 00:37:55,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:55,620 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-10-24 00:37:55,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:37:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-10-24 00:37:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-24 00:37:55,622 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:55,623 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, 1, 1, 1] [2020-10-24 00:37:55,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:37:55,623 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:55,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:55,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1206167652, now seen corresponding path program 1 times [2020-10-24 00:37:55,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:55,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1525437789] [2020-10-24 00:37:55,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:55,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:55,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 00:37:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:55,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:37:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:55,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:37:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 00:37:55,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1525437789] [2020-10-24 00:37:55,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:55,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:37:55,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999843725] [2020-10-24 00:37:55,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:37:55,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:55,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:37:55,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:37:55,781 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 7 states. [2020-10-24 00:37:56,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:56,063 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2020-10-24 00:37:56,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:37:56,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2020-10-24 00:37:56,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:56,065 INFO L225 Difference]: With dead ends: 65 [2020-10-24 00:37:56,066 INFO L226 Difference]: Without dead ends: 42 [2020-10-24 00:37:56,067 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-10-24 00:37:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-24 00:37:56,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-10-24 00:37:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-24 00:37:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2020-10-24 00:37:56,081 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 45 [2020-10-24 00:37:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:56,081 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2020-10-24 00:37:56,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:37:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-10-24 00:37:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-24 00:37:56,083 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:56,083 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, 1, 1, 1] [2020-10-24 00:37:56,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:37:56,084 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:56,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:56,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1636516106, now seen corresponding path program 1 times [2020-10-24 00:37:56,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:56,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [416098245] [2020-10-24 00:37:56,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:56,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:56,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 00:37:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:56,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:37:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:56,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:37:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-24 00:37:56,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [416098245] [2020-10-24 00:37:56,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:56,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:37:56,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616429482] [2020-10-24 00:37:56,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:37:56,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:56,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:37:56,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:37:56,295 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 12 states. [2020-10-24 00:37:57,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:57,220 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2020-10-24 00:37:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 00:37:57,228 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2020-10-24 00:37:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:57,231 INFO L225 Difference]: With dead ends: 60 [2020-10-24 00:37:57,231 INFO L226 Difference]: Without dead ends: 53 [2020-10-24 00:37:57,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:37:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-24 00:37:57,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2020-10-24 00:37:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-24 00:37:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2020-10-24 00:37:57,260 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 46 [2020-10-24 00:37:57,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:57,261 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2020-10-24 00:37:57,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:37:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2020-10-24 00:37:57,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-24 00:37:57,264 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:57,264 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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, 1] [2020-10-24 00:37:57,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:37:57,264 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:57,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:57,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1018144491, now seen corresponding path program 1 times [2020-10-24 00:37:57,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:57,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1210921050] [2020-10-24 00:37:57,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:57,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:57,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 00:37:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:57,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:37:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:57,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:37:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:57,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:37:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:57,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:37:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-24 00:37:57,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1210921050] [2020-10-24 00:37:57,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:57,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:37:57,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132181307] [2020-10-24 00:37:57,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:37:57,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:57,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:37:57,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:37:57,503 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 7 states. [2020-10-24 00:37:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:58,001 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2020-10-24 00:37:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:37:58,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2020-10-24 00:37:58,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:58,006 INFO L225 Difference]: With dead ends: 86 [2020-10-24 00:37:58,006 INFO L226 Difference]: Without dead ends: 52 [2020-10-24 00:37:58,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:37:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-24 00:37:58,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-10-24 00:37:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-24 00:37:58,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2020-10-24 00:37:58,035 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 65 [2020-10-24 00:37:58,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:58,036 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2020-10-24 00:37:58,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:37:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-10-24 00:37:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-24 00:37:58,044 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:58,045 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, 1, 1, 1] [2020-10-24 00:37:58,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:37:58,045 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:58,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:58,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1280637961, now seen corresponding path program 2 times [2020-10-24 00:37:58,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:58,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1226694339] [2020-10-24 00:37:58,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:58,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:58,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 00:37:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:58,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:37:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:58,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:37:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:58,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:37:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:58,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:37:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-24 00:37:58,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1226694339] [2020-10-24 00:37:58,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:58,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:37:58,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593760300] [2020-10-24 00:37:58,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:37:58,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:58,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:37:58,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:37:58,261 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 8 states. [2020-10-24 00:37:58,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:37:58,680 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2020-10-24 00:37:58,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:37:58,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2020-10-24 00:37:58,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:37:58,683 INFO L225 Difference]: With dead ends: 87 [2020-10-24 00:37:58,684 INFO L226 Difference]: Without dead ends: 52 [2020-10-24 00:37:58,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:37:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-24 00:37:58,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-10-24 00:37:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-24 00:37:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2020-10-24 00:37:58,703 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 63 [2020-10-24 00:37:58,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:37:58,703 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2020-10-24 00:37:58,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:37:58,704 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2020-10-24 00:37:58,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-24 00:37:58,708 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:37:58,708 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, 1, 1, 1] [2020-10-24 00:37:58,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:37:58,709 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:37:58,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:37:58,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1382349825, now seen corresponding path program 3 times [2020-10-24 00:37:58,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:37:58,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1675946588] [2020-10-24 00:37:58,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:37:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:58,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:37:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:58,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 00:37:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:58,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:37:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:58,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:37:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:58,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:37:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:58,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:37:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:37:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 00:37:58,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1675946588] [2020-10-24 00:37:58,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:37:58,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:37:58,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995170417] [2020-10-24 00:37:58,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:37:58,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:37:58,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:37:58,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:37:58,992 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 14 states. [2020-10-24 00:38:00,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:00,057 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2020-10-24 00:38:00,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 00:38:00,058 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2020-10-24 00:38:00,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:00,060 INFO L225 Difference]: With dead ends: 70 [2020-10-24 00:38:00,060 INFO L226 Difference]: Without dead ends: 63 [2020-10-24 00:38:00,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2020-10-24 00:38:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-24 00:38:00,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2020-10-24 00:38:00,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-24 00:38:00,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2020-10-24 00:38:00,094 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 64 [2020-10-24 00:38:00,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:00,094 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2020-10-24 00:38:00,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:38:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2020-10-24 00:38:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-24 00:38:00,101 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:00,101 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-10-24 00:38:00,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:38:00,101 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:00,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:00,102 INFO L82 PathProgramCache]: Analyzing trace with hash -234313849, now seen corresponding path program 4 times [2020-10-24 00:38:00,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:00,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [196491587] [2020-10-24 00:38:00,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:00,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:00,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 00:38:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:00,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:00,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:00,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:38:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:00,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:38:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:00,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:00,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:00,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:38:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:00,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:38:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 57 proven. 70 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-24 00:38:00,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [196491587] [2020-10-24 00:38:00,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:00,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:38:00,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026161291] [2020-10-24 00:38:00,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:38:00,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:00,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:38:00,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:38:00,425 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 9 states. [2020-10-24 00:38:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:01,159 INFO L93 Difference]: Finished difference Result 108 states and 137 transitions. [2020-10-24 00:38:01,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:38:01,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2020-10-24 00:38:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:01,162 INFO L225 Difference]: With dead ends: 108 [2020-10-24 00:38:01,162 INFO L226 Difference]: Without dead ends: 71 [2020-10-24 00:38:01,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:38:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-24 00:38:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2020-10-24 00:38:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-24 00:38:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2020-10-24 00:38:01,202 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 99 [2020-10-24 00:38:01,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:01,203 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2020-10-24 00:38:01,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:38:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2020-10-24 00:38:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-10-24 00:38:01,205 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:01,205 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, 1, 1, 1] [2020-10-24 00:38:01,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:38:01,205 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:01,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:01,206 INFO L82 PathProgramCache]: Analyzing trace with hash 85893735, now seen corresponding path program 5 times [2020-10-24 00:38:01,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:01,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [209684203] [2020-10-24 00:38:01,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:01,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:01,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 00:38:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:01,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:01,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:01,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:01,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:38:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:01,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:38:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:01,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:38:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:01,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:01,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:01,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:01,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:38:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:01,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:38:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:01,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:38:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 130 proven. 176 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-10-24 00:38:01,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [209684203] [2020-10-24 00:38:01,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:01,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:38:01,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313535166] [2020-10-24 00:38:01,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:38:01,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:01,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:38:01,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:38:01,606 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 11 states. [2020-10-24 00:38:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:02,635 INFO L93 Difference]: Finished difference Result 136 states and 179 transitions. [2020-10-24 00:38:02,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 00:38:02,636 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 135 [2020-10-24 00:38:02,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:02,640 INFO L225 Difference]: With dead ends: 136 [2020-10-24 00:38:02,641 INFO L226 Difference]: Without dead ends: 88 [2020-10-24 00:38:02,644 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:38:02,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-10-24 00:38:02,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2020-10-24 00:38:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-24 00:38:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2020-10-24 00:38:02,674 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 135 [2020-10-24 00:38:02,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:02,674 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2020-10-24 00:38:02,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:38:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2020-10-24 00:38:02,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-24 00:38:02,676 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:38:02,676 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-10-24 00:38:02,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:38:02,676 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:38:02,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:38:02,677 INFO L82 PathProgramCache]: Analyzing trace with hash -304626607, now seen corresponding path program 6 times [2020-10-24 00:38:02,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:38:02,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [60839800] [2020-10-24 00:38:02,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:38:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:02,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:38:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:02,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-24 00:38:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:02,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:02,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:02,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:02,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:38:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:02,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:38:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:02,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:38:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:02,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:38:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:02,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:38:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:38:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 8 proven. 109 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2020-10-24 00:38:02,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [60839800] [2020-10-24 00:38:02,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:38:02,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 00:38:02,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322369410] [2020-10-24 00:38:02,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 00:38:02,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:38:02,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 00:38:02,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:38:02,989 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand 16 states. [2020-10-24 00:38:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:38:03,966 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2020-10-24 00:38:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 00:38:03,967 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 99 [2020-10-24 00:38:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:38:03,967 INFO L225 Difference]: With dead ends: 79 [2020-10-24 00:38:03,968 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:38:03,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2020-10-24 00:38:03,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:38:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:38:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:38:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:38:03,970 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2020-10-24 00:38:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:38:03,970 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:38:03,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 00:38:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:38:03,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:38:03,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:38:03,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:38:06,362 WARN L193 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 24 [2020-10-24 00:38:06,535 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 16 [2020-10-24 00:38:06,807 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 16 [2020-10-24 00:38:07,033 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 28 [2020-10-24 00:38:07,315 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 19 [2020-10-24 00:38:07,711 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 19 [2020-10-24 00:38:07,869 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 9 [2020-10-24 00:38:08,441 WARN L193 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 24 [2020-10-24 00:38:08,573 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 6 [2020-10-24 00:38:08,803 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-24 00:38:08,803 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-24 00:38:08,804 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-24 00:38:08,804 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-24 00:38:08,804 INFO L270 CegarLoopResult]: At program point fibonacciFINAL(lines 16 24) the Hoare annotation is: (let ((.cse1 (<= |fibonacci_#in~n| 0))) (let ((.cse2 (or (and .cse1 (<= |fibonacci_#res| 0)) (and (<= 1 |fibonacci_#res|) (<= |fibonacci_#res| 1)))) (.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 .cse1 (<= 0 |fibonacci_#res|) .cse2) (and (<= 1 |fibonacci_#in~n|) (<= |fibonacci_#in~n| 1) .cse0 .cse2) (and .cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)) (<= 2 |fibonacci_#in~n|))))) [2020-10-24 00:38:08,804 INFO L277 CegarLoopResult]: At program point fibonacciENTRY(lines 16 24) the Hoare annotation is: true [2020-10-24 00:38:08,804 INFO L270 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (<= 2 |fibonacci_#in~n|)) [2020-10-24 00:38:08,805 INFO L270 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 (<= 3 |fibonacci_#in~n|) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))) (and (<= |fibonacci_#in~n| 2) .cse0 (<= 1 |fibonacci_#t~ret7|) (<= 2 |fibonacci_#in~n|)))) [2020-10-24 00:38:08,805 INFO L270 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= 1 |fibonacci_#in~n|) (<= |fibonacci_#in~n| 1) (= fibonacci_~n |fibonacci_#in~n|)) [2020-10-24 00:38:08,805 INFO L270 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 (<= 3 |fibonacci_#in~n|) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))) (and (<= |fibonacci_#in~n| 2) .cse0 (<= 1 |fibonacci_#t~ret7|) (<= 2 |fibonacci_#in~n|)))) [2020-10-24 00:38:08,805 INFO L270 CegarLoopResult]: At program point L19(lines 19 23) the Hoare annotation is: (and (<= 1 |fibonacci_#in~n|) (= fibonacci_~n |fibonacci_#in~n|)) [2020-10-24 00:38:08,805 INFO L270 CegarLoopResult]: At program point L22-3(line 22) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|)) (.cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| |fibonacci_#t~ret8| 1)))) (or (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 1)) .cse0 .cse1 (<= 2 |fibonacci_#in~n|)) (and (<= 3 fibonacci_~n) .cse0 .cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))))) [2020-10-24 00:38:08,806 INFO L270 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (<= |fibonacci_#in~n| 0)) [2020-10-24 00:38:08,806 INFO L270 CegarLoopResult]: At program point L22-4(line 22) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|)) (.cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| |fibonacci_#t~ret8| 1)))) (or (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 1)) .cse0 .cse1 (<= 2 |fibonacci_#in~n|)) (and (<= 3 fibonacci_~n) .cse0 .cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))))) [2020-10-24 00:38:08,808 INFO L270 CegarLoopResult]: At program point fibonacciEXIT(lines 16 24) the Hoare annotation is: (let ((.cse1 (<= |fibonacci_#in~n| 0))) (let ((.cse2 (or (and .cse1 (<= |fibonacci_#res| 0)) (and (<= 1 |fibonacci_#res|) (<= |fibonacci_#res| 1)))) (.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 .cse1 (<= 0 |fibonacci_#res|) .cse2) (and (<= 1 |fibonacci_#in~n|) (<= |fibonacci_#in~n| 1) .cse0 .cse2) (and .cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)) (<= 2 |fibonacci_#in~n|))))) [2020-10-24 00:38:08,808 INFO L270 CegarLoopResult]: At program point L17(lines 17 23) the Hoare annotation is: (= fibonacci_~n |fibonacci_#in~n|) [2020-10-24 00:38:08,808 INFO L270 CegarLoopResult]: At program point L22-5(line 22) the Hoare annotation is: (and (not (<= |fibonacci_#in~n| 1)) (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|)) (.cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)))) (or (and .cse0 .cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| |fibonacci_#t~ret8| 1)) (<= 3 |fibonacci_#in~n|) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))) (and (<= fibonacci_~n 2) (<= 1 (+ |fibonacci_#t~ret7| |fibonacci_#t~ret8|)) .cse0 .cse1 (<= 1 |fibonacci_#t~ret7|))))) [2020-10-24 00:38:08,808 INFO L270 CegarLoopResult]: At program point L22-6(line 22) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)) (< 1 fibonacci_~n)) [2020-10-24 00:38:08,809 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-24 00:38:08,809 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-24 00:38:08,809 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:38:08,809 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-24 00:38:08,809 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 00:38:08,809 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-24 00:38:08,809 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:38:08,809 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-24 00:38:08,810 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-24 00:38:08,810 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:38:08,810 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:38:08,810 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:38:08,810 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 00:38:08,810 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 00:38:08,810 INFO L270 CegarLoopResult]: At program point L33(lines 33 37) the Hoare annotation is: (<= main_~x~0 (+ main_~result~0 1)) [2020-10-24 00:38:08,810 INFO L277 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-10-24 00:38:08,810 INFO L270 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (<= main_~x~0 (+ |main_#t~ret10| 1)) [2020-10-24 00:38:08,811 INFO L277 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-10-24 00:38:08,811 INFO L270 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: (<= main_~x~0 (+ |main_#t~ret10| 1)) [2020-10-24 00:38:08,811 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 27 38) the Hoare annotation is: true [2020-10-24 00:38:08,811 INFO L277 CegarLoopResult]: At program point L29(lines 29 31) the Hoare annotation is: true [2020-10-24 00:38:08,811 INFO L270 CegarLoopResult]: At program point L32-3(line 32) the Hoare annotation is: (and (<= main_~x~0 (+ main_~result~0 1)) (<= main_~x~0 (+ |main_#t~ret10| 1))) [2020-10-24 00:38:08,811 INFO L277 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-10-24 00:38:08,811 INFO L277 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-10-24 00:38:08,811 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 27 38) the Hoare annotation is: true [2020-10-24 00:38:08,812 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 27 38) the Hoare annotation is: true [2020-10-24 00:38:08,812 INFO L270 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: false [2020-10-24 00:38:08,812 INFO L270 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: false [2020-10-24 00:38:08,813 INFO L277 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-10-24 00:38:08,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:38:08 BoogieIcfgContainer [2020-10-24 00:38:08,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:38:08,840 INFO L168 Benchmark]: Toolchain (without parser) took 15955.95 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 127.5 MB in the beginning and 148.1 MB in the end (delta: -20.6 MB). Peak memory consumption was 186.5 MB. Max. memory is 8.0 GB. [2020-10-24 00:38:08,842 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 125.8 MB. Free memory was 100.6 MB in the beginning and 100.4 MB in the end (delta: 120.6 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:38:08,845 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.33 ms. Allocated memory is still 151.0 MB. Free memory was 126.9 MB in the beginning and 117.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:38:08,846 INFO L168 Benchmark]: Boogie Preprocessor took 34.72 ms. Allocated memory is still 151.0 MB. Free memory was 117.5 MB in the beginning and 116.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 00:38:08,850 INFO L168 Benchmark]: RCFGBuilder took 426.04 ms. Allocated memory is still 151.0 MB. Free memory was 116.0 MB in the beginning and 102.0 MB in the end (delta: 14.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-10-24 00:38:08,854 INFO L168 Benchmark]: TraceAbstraction took 15219.30 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 134.4 MB in the beginning and 148.1 MB in the end (delta: -13.7 MB). Peak memory consumption was 192.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:38:08,862 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 125.8 MB. Free memory was 100.6 MB in the beginning and 100.4 MB in the end (delta: 120.6 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 236.33 ms. Allocated memory is still 151.0 MB. Free memory was 126.9 MB in the beginning and 117.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.72 ms. Allocated memory is still 151.0 MB. Free memory was 117.5 MB in the beginning and 116.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 426.04 ms. Allocated memory is still 151.0 MB. Free memory was 116.0 MB in the beginning and 102.0 MB in the end (delta: 14.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15219.30 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 134.4 MB in the beginning and 148.1 MB in the end (delta: -13.7 MB). Peak memory consumption was 192.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for fibonacci Derived contract for procedure fibonacci: ((((n == \old(n) && \old(n) <= 0) && 0 <= \result) && ((\old(n) <= 0 && \result <= 0) || (1 <= \result && \result <= 1))) || (((1 <= \old(n) && \old(n) <= 1) && n == \old(n)) && ((\old(n) <= 0 && \result <= 0) || (1 <= \result && \result <= 1)))) || ((n == \old(n) && \old(n) <= \result + 1) && 2 <= \old(n)) - ProcedureContractResult [Line: 27]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.2s, OverallIterations: 10, TraceHistogramMax: 13, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 354 SDtfs, 633 SDslu, 832 SDs, 0 SdLazy, 1763 SolverSat, 274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 29 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 47 LocationsWithAnnotation, 419 PreInvPairs, 708 NumberOfFragments, 433 HoareAnnotationTreeSize, 419 FomulaSimplifications, 40121 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 47 FomulaSimplificationsInter, 10882 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 673 NumberOfCodeBlocks, 673 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 663 ConstructedInterpolants, 0 QuantifiedInterpolants, 133071 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 675/1096 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 correct! Received shutdown request...