/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:40:50,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:40:50,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:40:50,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:40:50,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:40:50,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:40:50,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:40:50,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:40:50,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:40:50,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:40:50,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:40:50,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:40:50,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:40:50,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:40:50,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:40:50,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:40:50,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:40:50,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:40:50,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:40:50,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:40:50,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:40:50,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:40:50,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:40:50,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:40:50,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:40:50,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:40:50,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:40:50,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:40:50,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:40:50,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:40:50,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:40:50,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:40:50,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:40:50,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:40:50,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:40:50,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:40:50,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:40:50,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:40:50,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:40:50,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:40:50,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:40:50,313 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:40:50,337 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:40:50,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:40:50,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:40:50,343 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:40:50,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:40:50,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:40:50,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:40:50,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:40:50,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:40:50,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:40:50,345 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:40:50,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:40:50,345 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:40:50,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:40:50,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:40:50,346 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:40:50,346 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:40:50,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:40:50,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:40:50,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:40:50,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:40:50,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:40:50,348 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 [2020-11-07 00:40:50,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:40:50,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:40:50,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:40:50,839 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:40:50,840 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:40:50,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_5-1.c [2020-11-07 00:40:50,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a8d13c2/a275c111a0214c3f8359efe599f02752/FLAG2449c2645 [2020-11-07 00:40:51,589 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:40:51,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_5-1.c [2020-11-07 00:40:51,599 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a8d13c2/a275c111a0214c3f8359efe599f02752/FLAG2449c2645 [2020-11-07 00:40:51,948 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73a8d13c2/a275c111a0214c3f8359efe599f02752 [2020-11-07 00:40:51,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:40:51,958 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:40:51,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:40:51,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:40:51,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:40:51,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:40:51" (1/1) ... [2020-11-07 00:40:51,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ba116a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:51, skipping insertion in model container [2020-11-07 00:40:51,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:40:51" (1/1) ... [2020-11-07 00:40:51,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:40:51,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:40:52,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:40:52,166 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:40:52,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:40:52,201 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:40:52,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:52 WrapperNode [2020-11-07 00:40:52,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:40:52,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:40:52,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:40:52,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:40:52,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:52" (1/1) ... [2020-11-07 00:40:52,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:52" (1/1) ... [2020-11-07 00:40:52,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:52" (1/1) ... [2020-11-07 00:40:52,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:52" (1/1) ... [2020-11-07 00:40:52,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:52" (1/1) ... [2020-11-07 00:40:52,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:52" (1/1) ... [2020-11-07 00:40:52,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:52" (1/1) ... [2020-11-07 00:40:52,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:40:52,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:40:52,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:40:52,238 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:40:52,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:40:52,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:40:52,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:40:52,324 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:40:52,324 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-11-07 00:40:52,324 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:40:52,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:40:52,325 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:40:52,325 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:40:52,325 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:40:52,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:40:52,326 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-11-07 00:40:52,326 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:40:52,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:40:52,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:40:52,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:40:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:40:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:40:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:40:52,671 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:40:52,672 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:40:52,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:40:52 BoogieIcfgContainer [2020-11-07 00:40:52,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:40:52,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:40:52,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:40:52,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:40:52,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:40:51" (1/3) ... [2020-11-07 00:40:52,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5f1ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:40:52, skipping insertion in model container [2020-11-07 00:40:52,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:52" (2/3) ... [2020-11-07 00:40:52,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5f1ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:40:52, skipping insertion in model container [2020-11-07 00:40:52,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:40:52" (3/3) ... [2020-11-07 00:40:52,685 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_5-1.c [2020-11-07 00:40:52,755 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:40:52,768 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:40:52,814 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:40:52,882 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:40:52,883 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:40:52,883 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:40:52,883 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:40:52,883 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:40:52,883 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:40:52,884 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:40:52,884 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:40:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-11-07 00:40:52,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:40:52,940 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:52,942 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:52,943 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:52,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:52,965 INFO L82 PathProgramCache]: Analyzing trace with hash -32329728, now seen corresponding path program 1 times [2020-11-07 00:40:52,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:52,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1779955486] [2020-11-07 00:40:52,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:53,099 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:53,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:53,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:40:53,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1779955486] [2020-11-07 00:40:53,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:53,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:40:53,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961269746] [2020-11-07 00:40:53,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:40:53,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:53,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:40:53,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:40:53,664 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2020-11-07 00:40:54,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:54,130 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-11-07 00:40:54,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:40:54,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:40:54,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:54,154 INFO L225 Difference]: With dead ends: 57 [2020-11-07 00:40:54,155 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 00:40:54,165 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:40:54,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 00:40:54,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 00:40:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 00:40:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 00:40:54,254 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2020-11-07 00:40:54,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:54,257 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 00:40:54,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:40:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 00:40:54,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 00:40:54,261 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:54,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:54,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:40:54,262 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:54,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:54,265 INFO L82 PathProgramCache]: Analyzing trace with hash 950139466, now seen corresponding path program 1 times [2020-11-07 00:40:54,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:54,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [555288292] [2020-11-07 00:40:54,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:54,272 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:54,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:54,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:40:54,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [555288292] [2020-11-07 00:40:54,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:54,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:40:54,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374258869] [2020-11-07 00:40:54,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:40:54,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:54,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:40:54,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:40:54,396 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2020-11-07 00:40:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:54,614 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-11-07 00:40:54,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:40:54,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 00:40:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:54,617 INFO L225 Difference]: With dead ends: 46 [2020-11-07 00:40:54,617 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 00:40:54,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:40:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 00:40:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-11-07 00:40:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 00:40:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 00:40:54,633 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2020-11-07 00:40:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:54,633 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 00:40:54,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:40:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 00:40:54,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 00:40:54,635 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:54,636 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:54,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:40:54,636 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:54,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:54,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1810718643, now seen corresponding path program 1 times [2020-11-07 00:40:54,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:54,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [498054453] [2020-11-07 00:40:54,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:54,640 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:54,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:54,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:54,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:54,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:40:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 00:40:54,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [498054453] [2020-11-07 00:40:54,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:54,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:40:54,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326884092] [2020-11-07 00:40:54,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:40:54,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:54,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:40:54,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:40:54,846 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2020-11-07 00:40:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:55,194 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-11-07 00:40:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:40:55,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 00:40:55,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:55,197 INFO L225 Difference]: With dead ends: 62 [2020-11-07 00:40:55,197 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 00:40:55,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:40:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 00:40:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 00:40:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 00:40:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 00:40:55,213 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 42 [2020-11-07 00:40:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:55,214 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 00:40:55,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:40:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 00:40:55,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:40:55,216 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:55,216 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:55,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:40:55,217 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:55,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:55,218 INFO L82 PathProgramCache]: Analyzing trace with hash 195045207, now seen corresponding path program 1 times [2020-11-07 00:40:55,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:55,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1585025644] [2020-11-07 00:40:55,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:55,221 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:55,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:55,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:55,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:55,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 00:40:55,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1585025644] [2020-11-07 00:40:55,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:55,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:40:55,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480300713] [2020-11-07 00:40:55,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:40:55,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:55,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:40:55,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:40:55,379 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-11-07 00:40:55,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:55,809 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-11-07 00:40:55,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:40:55,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-11-07 00:40:55,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:55,815 INFO L225 Difference]: With dead ends: 66 [2020-11-07 00:40:55,815 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 00:40:55,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:40:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 00:40:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 00:40:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 00:40:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2020-11-07 00:40:55,837 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 43 [2020-11-07 00:40:55,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:55,838 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2020-11-07 00:40:55,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:40:55,838 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-11-07 00:40:55,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 00:40:55,841 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:55,841 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:55,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:40:55,841 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:55,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:55,842 INFO L82 PathProgramCache]: Analyzing trace with hash -396245802, now seen corresponding path program 2 times [2020-11-07 00:40:55,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:55,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2048127014] [2020-11-07 00:40:55,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:55,847 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:55,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:55,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:56,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:56,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:56,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:56,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 00:40:56,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2048127014] [2020-11-07 00:40:56,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:56,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:40:56,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503132756] [2020-11-07 00:40:56,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:40:56,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:56,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:40:56,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:40:56,113 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 8 states. [2020-11-07 00:40:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:56,647 INFO L93 Difference]: Finished difference Result 118 states and 161 transitions. [2020-11-07 00:40:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:40:56,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 00:40:56,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:56,656 INFO L225 Difference]: With dead ends: 118 [2020-11-07 00:40:56,657 INFO L226 Difference]: Without dead ends: 73 [2020-11-07 00:40:56,659 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:40:56,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-07 00:40:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-11-07 00:40:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 00:40:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-11-07 00:40:56,700 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 60 [2020-11-07 00:40:56,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:56,702 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-11-07 00:40:56,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:40:56,702 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-11-07 00:40:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:40:56,715 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:56,716 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:56,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:40:56,717 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:56,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash -13012784, now seen corresponding path program 3 times [2020-11-07 00:40:56,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:56,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [536251366] [2020-11-07 00:40:56,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:56,726 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:56,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:56,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:56,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:56,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:56,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:56,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-07 00:40:56,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [536251366] [2020-11-07 00:40:56,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:56,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:40:56,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151368336] [2020-11-07 00:40:56,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:40:56,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:56,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:40:56,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:40:56,942 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2020-11-07 00:40:57,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:57,463 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2020-11-07 00:40:57,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:40:57,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-11-07 00:40:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:57,472 INFO L225 Difference]: With dead ends: 96 [2020-11-07 00:40:57,473 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 00:40:57,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:40:57,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 00:40:57,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2020-11-07 00:40:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-07 00:40:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2020-11-07 00:40:57,540 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 61 [2020-11-07 00:40:57,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:57,540 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2020-11-07 00:40:57,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:40:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2020-11-07 00:40:57,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 00:40:57,543 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:57,544 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:57,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:40:57,546 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:57,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:57,547 INFO L82 PathProgramCache]: Analyzing trace with hash 159854214, now seen corresponding path program 4 times [2020-11-07 00:40:57,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:57,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1431674959] [2020-11-07 00:40:57,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:57,553 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:57,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:57,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:57,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:57,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:57,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:57,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:57,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:57,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:57,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:57,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:57,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:57,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:57,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:57,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-11-07 00:40:57,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1431674959] [2020-11-07 00:40:57,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:57,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:40:57,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332686557] [2020-11-07 00:40:57,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:40:57,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:57,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:40:57,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:40:57,928 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand 9 states. [2020-11-07 00:40:58,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:40:58,601 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2020-11-07 00:40:58,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:40:58,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2020-11-07 00:40:58,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:40:58,614 INFO L225 Difference]: With dead ends: 146 [2020-11-07 00:40:58,614 INFO L226 Difference]: Without dead ends: 139 [2020-11-07 00:40:58,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:40:58,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-07 00:40:58,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2020-11-07 00:40:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 00:40:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2020-11-07 00:40:58,696 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 132 [2020-11-07 00:40:58,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:40:58,696 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2020-11-07 00:40:58,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:40:58,697 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2020-11-07 00:40:58,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-11-07 00:40:58,703 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:40:58,704 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:40:58,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:40:58,704 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:40:58,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:40:58,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1497778840, now seen corresponding path program 5 times [2020-11-07 00:40:58,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:40:58,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [551400005] [2020-11-07 00:40:58,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:40:58,709 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:40:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:58,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:40:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:58,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:40:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:58,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:58,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:58,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:58,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:58,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:58,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:58,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:58,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:58,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:58,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:40:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:59,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:59,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:59,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:59,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:59,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:59,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:40:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:59,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:40:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:59,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:40:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:59,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:40:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:59,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:40:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:40:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 70 proven. 102 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2020-11-07 00:40:59,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [551400005] [2020-11-07 00:40:59,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:40:59,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:40:59,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205702933] [2020-11-07 00:40:59,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:40:59,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:40:59,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:40:59,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:40:59,240 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand 14 states. [2020-11-07 00:41:00,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:00,909 INFO L93 Difference]: Finished difference Result 213 states and 326 transitions. [2020-11-07 00:41:00,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 00:41:00,910 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 202 [2020-11-07 00:41:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:00,913 INFO L225 Difference]: With dead ends: 213 [2020-11-07 00:41:00,913 INFO L226 Difference]: Without dead ends: 99 [2020-11-07 00:41:00,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=255, Invalid=867, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 00:41:00,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-11-07 00:41:00,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2020-11-07 00:41:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-07 00:41:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2020-11-07 00:41:00,942 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 202 [2020-11-07 00:41:00,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:00,942 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2020-11-07 00:41:00,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:41:00,943 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2020-11-07 00:41:00,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-11-07 00:41:00,945 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:00,945 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:00,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:41:00,945 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:00,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:00,946 INFO L82 PathProgramCache]: Analyzing trace with hash -799639331, now seen corresponding path program 6 times [2020-11-07 00:41:00,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:00,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [804836812] [2020-11-07 00:41:00,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:00,952 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2020-11-07 00:41:01,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [804836812] [2020-11-07 00:41:01,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:01,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 00:41:01,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068099655] [2020-11-07 00:41:01,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 00:41:01,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:01,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 00:41:01,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:41:01,612 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand 17 states. [2020-11-07 00:41:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:03,544 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2020-11-07 00:41:03,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 00:41:03,545 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 149 [2020-11-07 00:41:03,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:03,547 INFO L225 Difference]: With dead ends: 111 [2020-11-07 00:41:03,548 INFO L226 Difference]: Without dead ends: 104 [2020-11-07 00:41:03,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=170, Invalid=1390, Unknown=0, NotChecked=0, Total=1560 [2020-11-07 00:41:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-07 00:41:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2020-11-07 00:41:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-07 00:41:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2020-11-07 00:41:03,574 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 149 [2020-11-07 00:41:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:03,575 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2020-11-07 00:41:03,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 00:41:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2020-11-07 00:41:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-07 00:41:03,578 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:03,578 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:03,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:41:03,579 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:03,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:03,579 INFO L82 PathProgramCache]: Analyzing trace with hash 876241593, now seen corresponding path program 7 times [2020-11-07 00:41:03,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:03,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1861044914] [2020-11-07 00:41:03,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:03,582 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-11-07 00:41:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 30 proven. 44 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2020-11-07 00:41:03,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1861044914] [2020-11-07 00:41:03,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:03,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:41:03,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77770742] [2020-11-07 00:41:03,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:41:03,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:03,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:41:03,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:41:03,988 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand 11 states. [2020-11-07 00:41:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:04,796 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2020-11-07 00:41:04,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 00:41:04,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 184 [2020-11-07 00:41:04,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:04,800 INFO L225 Difference]: With dead ends: 176 [2020-11-07 00:41:04,800 INFO L226 Difference]: Without dead ends: 92 [2020-11-07 00:41:04,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2020-11-07 00:41:04,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-07 00:41:04,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-11-07 00:41:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-07 00:41:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2020-11-07 00:41:04,824 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 184 [2020-11-07 00:41:04,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:04,824 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2020-11-07 00:41:04,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:41:04,825 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2020-11-07 00:41:04,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-11-07 00:41:04,827 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:04,828 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:04,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:41:04,828 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:04,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:04,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1677663584, now seen corresponding path program 8 times [2020-11-07 00:41:04,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:04,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1041807134] [2020-11-07 00:41:04,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:04,832 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:04,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:04,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:04,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:41:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 58 proven. 58 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-11-07 00:41:05,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1041807134] [2020-11-07 00:41:05,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:05,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:41:05,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643001006] [2020-11-07 00:41:05,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:41:05,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:05,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:41:05,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:41:05,343 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 14 states. [2020-11-07 00:41:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:06,790 INFO L93 Difference]: Finished difference Result 172 states and 214 transitions. [2020-11-07 00:41:06,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:41:06,790 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 202 [2020-11-07 00:41:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:06,792 INFO L225 Difference]: With dead ends: 172 [2020-11-07 00:41:06,792 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:41:06,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2020-11-07 00:41:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:41:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:41:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:41:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:41:06,799 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 202 [2020-11-07 00:41:06,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:06,799 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:41:06,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:41:06,800 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:41:06,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:41:06,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:41:06,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:41:09,926 WARN L194 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 39 [2020-11-07 00:41:10,750 WARN L194 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 31 [2020-11-07 00:41:10,911 WARN L194 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 6 [2020-11-07 00:41:11,500 WARN L194 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 39 [2020-11-07 00:41:12,117 WARN L194 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 39 [2020-11-07 00:41:12,688 WARN L194 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2020-11-07 00:41:12,801 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 6 [2020-11-07 00:41:13,203 WARN L194 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2020-11-07 00:41:13,609 WARN L194 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2020-11-07 00:41:14,031 WARN L194 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 31 [2020-11-07 00:41:14,146 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 8 [2020-11-07 00:41:14,151 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 00:41:14,152 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 00:41:14,152 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:41:14,152 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 00:41:14,152 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 00:41:14,152 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 00:41:14,153 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:14,153 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:14,153 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:41:14,153 INFO L262 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-11-07 00:41:14,153 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 00:41:14,153 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 00:41:14,154 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 00:41:14,154 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:41:14,154 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:41:14,154 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:14,154 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:41:14,154 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:41:14,154 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 25 32) the Hoare annotation is: true [2020-11-07 00:41:14,154 INFO L262 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: false [2020-11-07 00:41:14,154 INFO L262 CegarLoopResult]: At program point L28(lines 28 30) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-11-07 00:41:14,154 INFO L262 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: false [2020-11-07 00:41:14,154 INFO L262 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0)) [2020-11-07 00:41:14,155 INFO L262 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (and (<= 5 |main_#t~ret9|) (<= main_~x~0 5) (<= |main_#t~ret9| 5) (<= 5 main_~x~0)) [2020-11-07 00:41:14,155 INFO L262 CegarLoopResult]: At program point L28-2(lines 28 30) the Hoare annotation is: (<= 5 main_~x~0) [2020-11-07 00:41:14,155 INFO L262 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (and (<= 5 |main_#t~ret9|) (<= main_~x~0 5) (<= |main_#t~ret9| 5) (<= 5 main_~x~0)) [2020-11-07 00:41:14,155 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 25 32) the Hoare annotation is: (<= 5 main_~x~0) [2020-11-07 00:41:14,155 INFO L262 CegarLoopResult]: At program point L27-3(line 27) the Hoare annotation is: (and (<= 5 |main_#t~ret9|) (<= main_~x~0 5) (<= |main_#t~ret9| 5) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-11-07 00:41:14,155 INFO L262 CegarLoopResult]: At program point mainFINAL(lines 25 32) the Hoare annotation is: (<= 5 main_~x~0) [2020-11-07 00:41:14,155 INFO L262 CegarLoopResult]: At program point fiboEXIT(lines 7 15) the Hoare annotation is: (and (or (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|) (<= |fibo_#in~n| 3)) (and (<= 5 |fibo_#res|) (<= 5 |fibo_#in~n|) (<= |fibo_#res| 5)) (<= |fibo_#in~n| 0) (<= 6 fibo_~n) (and (<= |fibo_#in~n| 4) (<= |fibo_#res| 3) (<= 3 |fibo_#res|) (<= 4 |fibo_#in~n|)) (and (<= 1 |fibo_#res|) (<= |fibo_#res| 1) (<= |fibo_#in~n| 2))) (let ((.cse0 (= fibo_~n |fibo_#in~n|))) (or (and (< 0 fibo_~n) .cse0) (and (<= 0 |fibo_#res|) .cse0 (<= |fibo_#res| 0))))) [2020-11-07 00:41:14,155 INFO L262 CegarLoopResult]: At program point fiboFINAL(lines 7 15) the Hoare annotation is: (and (or (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|) (<= |fibo_#in~n| 3)) (and (<= 5 |fibo_#res|) (<= 5 |fibo_#in~n|) (<= |fibo_#res| 5)) (<= |fibo_#in~n| 0) (<= 6 fibo_~n) (and (<= |fibo_#in~n| 4) (<= |fibo_#res| 3) (<= 3 |fibo_#res|) (<= 4 |fibo_#in~n|)) (and (<= 1 |fibo_#res|) (<= |fibo_#res| 1) (<= |fibo_#in~n| 2))) (let ((.cse0 (= fibo_~n |fibo_#in~n|))) (or (and (< 0 fibo_~n) .cse0) (and (<= 0 |fibo_#res|) .cse0 (<= |fibo_#res| 0))))) [2020-11-07 00:41:14,156 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 2 |fibo_#in~n|) (= fibo_~n |fibo_#in~n|)) [2020-11-07 00:41:14,156 INFO L262 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (let ((.cse0 (= fibo_~n |fibo_#in~n|))) (and (or (not (<= 4 |fibo_#in~n|)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) .cse0 (<= 2 |fibo_#t~ret7|)) (and (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse0 (<= 3 |fibo_#t~ret7|)) (and (<= 6 fibo_~n) .cse0)) (or (and (<= |fibo_#t~ret7| 1) (<= 1 |fibo_#t~ret7|) .cse0) (not (<= |fibo_#in~n| 3))) (<= 2 |fibo_#in~n|))) [2020-11-07 00:41:14,156 INFO L262 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo_#in~n| 1) (< 0 fibo_~n) (= fibo_~n |fibo_#in~n|)) [2020-11-07 00:41:14,156 INFO L262 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (let ((.cse0 (= fibo_~n |fibo_#in~n|))) (and (or (not (<= 4 |fibo_#in~n|)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) .cse0 (<= 2 |fibo_#t~ret7|)) (and (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse0 (<= 3 |fibo_#t~ret7|)) (and (<= 6 fibo_~n) .cse0)) (or (and (<= |fibo_#t~ret7| 1) (<= 1 |fibo_#t~ret7|) .cse0) (not (<= |fibo_#in~n| 3))) (<= 2 |fibo_#in~n|))) [2020-11-07 00:41:14,156 INFO L262 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (< 0 fibo_~n) (= fibo_~n |fibo_#in~n|)) [2020-11-07 00:41:14,157 INFO L262 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (let ((.cse1 (<= |fibo_#t~ret7| 1)) (.cse0 (+ |fibo_#t~ret8| |fibo_#t~ret7|)) (.cse2 (<= 1 |fibo_#t~ret7|)) (.cse5 (<= |fibo_#in~n| 2)) (.cse3 (= fibo_~n |fibo_#in~n|))) (let ((.cse4 (and .cse1 (<= 1 .cse0) (<= .cse0 1) .cse2 .cse5 .cse3))) (and (or (and (<= .cse0 2) .cse1 (<= 2 .cse0) .cse2 .cse3 (<= |fibo_#in~n| 3)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= 3 .cse0) (<= .cse0 3) .cse3 (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (and (<= 5 .cse0) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse3 (<= 3 |fibo_#t~ret7|) (<= .cse0 5)) .cse4 (and (<= 6 fibo_~n) .cse3)) (not (<= |fibo_#in~n| 1)) (or (not .cse5) .cse4)))) [2020-11-07 00:41:14,157 INFO L262 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (<= |fibo_#in~n| 0) (= fibo_~n |fibo_#in~n|)) [2020-11-07 00:41:14,157 INFO L262 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (let ((.cse1 (<= |fibo_#t~ret7| 1)) (.cse0 (+ |fibo_#t~ret8| |fibo_#t~ret7|)) (.cse2 (<= 1 |fibo_#t~ret7|)) (.cse5 (<= |fibo_#in~n| 2)) (.cse3 (= fibo_~n |fibo_#in~n|))) (let ((.cse4 (and .cse1 (<= 1 .cse0) (<= .cse0 1) .cse2 .cse5 .cse3))) (and (or (and (<= .cse0 2) .cse1 (<= 2 .cse0) .cse2 .cse3 (<= |fibo_#in~n| 3)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= 3 .cse0) (<= .cse0 3) .cse3 (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (and (<= 5 .cse0) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse3 (<= 3 |fibo_#t~ret7|) (<= .cse0 5)) .cse4 (and (<= 6 fibo_~n) .cse3)) (not (<= |fibo_#in~n| 1)) (or (not .cse5) .cse4)))) [2020-11-07 00:41:14,157 INFO L262 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo_~n |fibo_#in~n|) [2020-11-07 00:41:14,158 INFO L262 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse2 (<= |fibo_#t~ret7| 1)) (.cse0 (+ |fibo_#t~ret8| |fibo_#t~ret7|)) (.cse3 (<= 1 |fibo_#t~ret7|)) (.cse1 (= fibo_~n |fibo_#in~n|))) (and (or (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= 3 .cse0) (<= |fibo_#res| 3) (<= .cse0 3) .cse1 (<= 3 |fibo_#res|) (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (and (<= .cse0 2) .cse2 (<= 2 |fibo_#res|) (<= 2 .cse0) .cse3 (<= |fibo_#res| 2) .cse1 (<= |fibo_#in~n| 3)) (not (<= 3 |fibo_#in~n|)) (and (<= 5 |fibo_#res|) (<= 5 .cse0) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse1 (<= 3 |fibo_#t~ret7|) (<= .cse0 5) (<= |fibo_#res| 5)) (and (<= 6 fibo_~n) .cse1)) (or (not (<= |fibo_#in~n| 2)) (and (<= 1 |fibo_#res|) .cse2 (<= 1 .cse0) (<= .cse0 1) .cse3 (<= |fibo_#res| 1) .cse1)) (not (<= |fibo_#in~n| 1)))) [2020-11-07 00:41:14,158 INFO L262 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (let ((.cse1 (<= |fibo_#t~ret7| 1)) (.cse2 (<= 1 |fibo_#t~ret7|)) (.cse0 (= fibo_~n |fibo_#in~n|))) (or (and (<= 5 |fibo_#res|) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse0 (<= 3 |fibo_#t~ret7|) (<= |fibo_#res| 5)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= |fibo_#res| 3) .cse0 (<= 3 |fibo_#res|) (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (and .cse1 (<= 2 |fibo_#res|) .cse2 (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|) .cse0 (<= |fibo_#in~n| 3)) (and (<= 1 |fibo_#res|) .cse1 (<= 2 |fibo_#in~n|) .cse2 (<= |fibo_#res| 1) (<= |fibo_#in~n| 2) .cse0) (and (<= 6 fibo_~n) .cse0))) [2020-11-07 00:41:14,158 INFO L269 CegarLoopResult]: At program point fiboENTRY(lines 7 15) the Hoare annotation is: true [2020-11-07 00:41:14,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:41:14 BoogieIcfgContainer [2020-11-07 00:41:14,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:41:14,196 INFO L168 Benchmark]: Toolchain (without parser) took 22241.65 ms. Allocated memory was 162.5 MB in the beginning and 338.7 MB in the end (delta: 176.2 MB). Free memory was 139.7 MB in the beginning and 303.8 MB in the end (delta: -164.1 MB). Peak memory consumption was 198.2 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:14,200 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 162.5 MB. Free memory is still 137.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:41:14,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.38 ms. Allocated memory is still 162.5 MB. Free memory was 139.1 MB in the beginning and 130.2 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:14,204 INFO L168 Benchmark]: Boogie Preprocessor took 33.81 ms. Allocated memory is still 162.5 MB. Free memory was 130.0 MB in the beginning and 128.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:14,204 INFO L168 Benchmark]: RCFGBuilder took 436.41 ms. Allocated memory is still 162.5 MB. Free memory was 128.8 MB in the beginning and 115.3 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:14,205 INFO L168 Benchmark]: TraceAbstraction took 21517.24 ms. Allocated memory was 162.5 MB in the beginning and 338.7 MB in the end (delta: 176.2 MB). Free memory was 114.7 MB in the beginning and 303.8 MB in the end (delta: -189.0 MB). Peak memory consumption was 173.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:14,209 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.23 ms. Allocated memory is still 162.5 MB. Free memory is still 137.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 241.38 ms. Allocated memory is still 162.5 MB. Free memory was 139.1 MB in the beginning and 130.2 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 33.81 ms. Allocated memory is still 162.5 MB. Free memory was 130.0 MB in the beginning and 128.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 436.41 ms. Allocated memory is still 162.5 MB. Free memory was 128.8 MB in the beginning and 115.3 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 21517.24 ms. Allocated memory was 162.5 MB in the beginning and 338.7 MB in the end (delta: 176.2 MB). Free memory was 114.7 MB in the beginning and 303.8 MB in the end (delta: -189.0 MB). Peak memory consumption was 173.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 25]: Procedure Contract for main Derived contract for procedure main: 5 <= x - ProcedureContractResult [Line: 7]: Procedure Contract for fibo Derived contract for procedure fibo: ((((((((2 <= \result && \result <= 2) && 3 <= \old(n)) && \old(n) <= 3) || ((5 <= \result && 5 <= \old(n)) && \result <= 5)) || \old(n) <= 0) || 6 <= n) || (((\old(n) <= 4 && \result <= 3) && 3 <= \result) && 4 <= \old(n))) || ((1 <= \result && \result <= 1) && \old(n) <= 2)) && ((0 < n && n == \old(n)) || ((0 <= \result && n == \old(n)) && \result <= 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.9s, OverallIterations: 11, TraceHistogramMax: 21, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 449 SDtfs, 749 SDslu, 884 SDs, 0 SdLazy, 2420 SolverSat, 400 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 49 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 811 PreInvPairs, 1358 NumberOfFragments, 921 HoareAnnotationTreeSize, 811 FomulaSimplifications, 35897 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 43 FomulaSimplificationsInter, 16513 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...