/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:53:33,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:53:33,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:53:34,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:53:34,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:53:34,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:53:34,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:53:34,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:53:34,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:53:34,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:53:34,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:53:34,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:53:34,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:53:34,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:53:34,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:53:34,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:53:34,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:53:34,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:53:34,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:53:34,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:53:34,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:53:34,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:53:34,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:53:34,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:53:34,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:53:34,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:53:34,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:53:34,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:53:34,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:53:34,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:53:34,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:53:34,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:53:34,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:53:34,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:53:34,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:53:34,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:53:34,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:53:34,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:53:34,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:53:34,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:53:34,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:53:34,076 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:53:34,089 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:53:34,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:53:34,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:53:34,091 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:53:34,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:53:34,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:53:34,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:53:34,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:53:34,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:53:34,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:53:34,093 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:53:34,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:53:34,093 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:53:34,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:53:34,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:53:34,094 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:53:34,094 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:53:34,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:53:34,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:53:34,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:53:34,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:53:34,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:53:34,095 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 00:53:34,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:53:34,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:53:34,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:53:34,552 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:53:34,553 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:53:34,555 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-10-24 00:53:34,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61cd3ca8a/441d495bcf6c4a33bfa8140e8637170b/FLAG28f175d25 [2020-10-24 00:53:35,421 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:53:35,421 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_5-1.c [2020-10-24 00:53:35,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61cd3ca8a/441d495bcf6c4a33bfa8140e8637170b/FLAG28f175d25 [2020-10-24 00:53:35,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61cd3ca8a/441d495bcf6c4a33bfa8140e8637170b [2020-10-24 00:53:35,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:53:35,772 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:53:35,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:53:35,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:53:35,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:53:35,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:53:35" (1/1) ... [2020-10-24 00:53:35,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30063588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:35, skipping insertion in model container [2020-10-24 00:53:35,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:53:35" (1/1) ... [2020-10-24 00:53:35,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:53:35,818 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:53:36,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:53:36,096 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:53:36,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:53:36,135 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:53:36,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:36 WrapperNode [2020-10-24 00:53:36,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:53:36,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:53:36,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:53:36,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:53:36,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:36" (1/1) ... [2020-10-24 00:53:36,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:36" (1/1) ... [2020-10-24 00:53:36,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:36" (1/1) ... [2020-10-24 00:53:36,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:36" (1/1) ... [2020-10-24 00:53:36,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:36" (1/1) ... [2020-10-24 00:53:36,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:36" (1/1) ... [2020-10-24 00:53:36,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:36" (1/1) ... [2020-10-24 00:53:36,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:53:36,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:53:36,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:53:36,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:53:36,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:53:36,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:53:36,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:53:36,293 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:53:36,293 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-10-24 00:53:36,293 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:53:36,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:53:36,294 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:53:36,294 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:53:36,294 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:53:36,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:53:36,295 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-10-24 00:53:36,295 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:53:36,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:53:36,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:53:36,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:53:36,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:53:36,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:53:36,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:53:36,589 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:53:36,590 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:53:36,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:53:36 BoogieIcfgContainer [2020-10-24 00:53:36,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:53:36,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:53:36,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:53:36,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:53:36,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:53:35" (1/3) ... [2020-10-24 00:53:36,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7280cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:53:36, skipping insertion in model container [2020-10-24 00:53:36,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:36" (2/3) ... [2020-10-24 00:53:36,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7280cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:53:36, skipping insertion in model container [2020-10-24 00:53:36,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:53:36" (3/3) ... [2020-10-24 00:53:36,603 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_5-1.c [2020-10-24 00:53:36,633 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:53:36,647 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:53:36,679 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:53:36,718 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:53:36,718 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:53:36,721 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:53:36,722 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:53:36,723 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:53:36,723 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:53:36,723 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:53:36,723 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:53:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-10-24 00:53:36,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:53:36,753 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:36,755 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-10-24 00:53:36,755 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:36,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:36,763 INFO L82 PathProgramCache]: Analyzing trace with hash -32329728, now seen corresponding path program 1 times [2020-10-24 00:53:36,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:36,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1201827425] [2020-10-24 00:53:36,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:37,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:37,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:53:37,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1201827425] [2020-10-24 00:53:37,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:53:37,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:53:37,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54555921] [2020-10-24 00:53:37,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:53:37,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:37,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:53:37,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:53:37,230 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2020-10-24 00:53:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:37,614 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-10-24 00:53:37,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:53:37,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:53:37,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:37,628 INFO L225 Difference]: With dead ends: 57 [2020-10-24 00:53:37,629 INFO L226 Difference]: Without dead ends: 37 [2020-10-24 00:53:37,634 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-10-24 00:53:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-24 00:53:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-24 00:53:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-24 00:53:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-10-24 00:53:37,744 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2020-10-24 00:53:37,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:37,747 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-10-24 00:53:37,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:53:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-10-24 00:53:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-24 00:53:37,751 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:37,752 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-10-24 00:53:37,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:53:37,755 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:37,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:37,759 INFO L82 PathProgramCache]: Analyzing trace with hash 950139466, now seen corresponding path program 1 times [2020-10-24 00:53:37,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:37,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [436623670] [2020-10-24 00:53:37,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:37,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:37,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:37,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:53:37,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [436623670] [2020-10-24 00:53:37,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:53:37,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:53:37,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112457114] [2020-10-24 00:53:37,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:53:37,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:37,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:53:37,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:53:37,937 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2020-10-24 00:53:38,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:38,184 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-10-24 00:53:38,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:53:38,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-24 00:53:38,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:38,188 INFO L225 Difference]: With dead ends: 46 [2020-10-24 00:53:38,188 INFO L226 Difference]: Without dead ends: 39 [2020-10-24 00:53:38,190 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-10-24 00:53:38,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-24 00:53:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-10-24 00:53:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-24 00:53:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-10-24 00:53:38,207 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2020-10-24 00:53:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:38,207 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-10-24 00:53:38,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:53:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-10-24 00:53:38,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-24 00:53:38,210 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:38,211 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-10-24 00:53:38,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:53:38,211 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:38,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:38,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1810718643, now seen corresponding path program 1 times [2020-10-24 00:53:38,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:38,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2141375653] [2020-10-24 00:53:38,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:38,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:38,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:38,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:38,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:53:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 00:53:38,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2141375653] [2020-10-24 00:53:38,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:38,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:53:38,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686715602] [2020-10-24 00:53:38,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:53:38,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:38,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:53:38,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:53:38,419 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2020-10-24 00:53:38,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:38,794 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-10-24 00:53:38,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:53:38,795 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-10-24 00:53:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:38,797 INFO L225 Difference]: With dead ends: 62 [2020-10-24 00:53:38,797 INFO L226 Difference]: Without dead ends: 39 [2020-10-24 00:53:38,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:53:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-24 00:53:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-24 00:53:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-24 00:53:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-10-24 00:53:38,814 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 42 [2020-10-24 00:53:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:38,814 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-10-24 00:53:38,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:53:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-10-24 00:53:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:53:38,816 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:38,816 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-10-24 00:53:38,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:53:38,817 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:38,818 INFO L82 PathProgramCache]: Analyzing trace with hash 195045207, now seen corresponding path program 1 times [2020-10-24 00:53:38,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:38,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2053107080] [2020-10-24 00:53:38,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:38,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:38,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:38,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:38,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-24 00:53:38,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2053107080] [2020-10-24 00:53:38,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:38,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:53:38,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368609586] [2020-10-24 00:53:38,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:53:38,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:38,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:53:38,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:53:38,973 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-10-24 00:53:39,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:39,325 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-10-24 00:53:39,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:53:39,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-10-24 00:53:39,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:39,328 INFO L225 Difference]: With dead ends: 66 [2020-10-24 00:53:39,329 INFO L226 Difference]: Without dead ends: 59 [2020-10-24 00:53:39,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:53:39,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-24 00:53:39,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-24 00:53:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-24 00:53:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2020-10-24 00:53:39,351 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 43 [2020-10-24 00:53:39,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:39,351 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2020-10-24 00:53:39,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:53:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-10-24 00:53:39,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 00:53:39,354 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:39,355 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-10-24 00:53:39,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:53:39,355 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:39,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:39,356 INFO L82 PathProgramCache]: Analyzing trace with hash -396245802, now seen corresponding path program 2 times [2020-10-24 00:53:39,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:39,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [339530728] [2020-10-24 00:53:39,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:39,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:39,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:39,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:39,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:39,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:39,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-24 00:53:39,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [339530728] [2020-10-24 00:53:39,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:39,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:53:39,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035333581] [2020-10-24 00:53:39,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:53:39,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:39,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:53:39,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:53:39,575 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 8 states. [2020-10-24 00:53:40,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:40,097 INFO L93 Difference]: Finished difference Result 118 states and 161 transitions. [2020-10-24 00:53:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:53:40,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-10-24 00:53:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:40,102 INFO L225 Difference]: With dead ends: 118 [2020-10-24 00:53:40,102 INFO L226 Difference]: Without dead ends: 73 [2020-10-24 00:53:40,104 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-10-24 00:53:40,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-24 00:53:40,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-10-24 00:53:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-24 00:53:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-10-24 00:53:40,131 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 60 [2020-10-24 00:53:40,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:40,132 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-10-24 00:53:40,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:53:40,132 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-10-24 00:53:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 00:53:40,135 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:40,135 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-10-24 00:53:40,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:53:40,135 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:40,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:40,136 INFO L82 PathProgramCache]: Analyzing trace with hash -13012784, now seen corresponding path program 3 times [2020-10-24 00:53:40,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:40,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1792383663] [2020-10-24 00:53:40,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-24 00:53:40,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1792383663] [2020-10-24 00:53:40,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:40,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:53:40,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392432096] [2020-10-24 00:53:40,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:53:40,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:40,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:53:40,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:53:40,305 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2020-10-24 00:53:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:40,826 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2020-10-24 00:53:40,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:53:40,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-10-24 00:53:40,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:40,840 INFO L225 Difference]: With dead ends: 96 [2020-10-24 00:53:40,840 INFO L226 Difference]: Without dead ends: 89 [2020-10-24 00:53:40,842 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-10-24 00:53:40,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-24 00:53:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2020-10-24 00:53:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-24 00:53:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2020-10-24 00:53:40,896 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 61 [2020-10-24 00:53:40,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:40,897 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2020-10-24 00:53:40,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:53:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2020-10-24 00:53:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-10-24 00:53:40,909 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:40,909 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-10-24 00:53:40,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:53:40,910 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:40,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:40,911 INFO L82 PathProgramCache]: Analyzing trace with hash 159854214, now seen corresponding path program 4 times [2020-10-24 00:53:40,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:40,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [959940076] [2020-10-24 00:53:40,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 36 proven. 197 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2020-10-24 00:53:41,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [959940076] [2020-10-24 00:53:41,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:41,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:53:41,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740164154] [2020-10-24 00:53:41,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:53:41,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:41,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:53:41,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:53:41,387 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand 9 states. [2020-10-24 00:53:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:42,079 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2020-10-24 00:53:42,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:53:42,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2020-10-24 00:53:42,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:42,093 INFO L225 Difference]: With dead ends: 146 [2020-10-24 00:53:42,094 INFO L226 Difference]: Without dead ends: 139 [2020-10-24 00:53:42,095 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-10-24 00:53:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-10-24 00:53:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2020-10-24 00:53:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-24 00:53:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2020-10-24 00:53:42,185 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 132 [2020-10-24 00:53:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:42,185 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2020-10-24 00:53:42,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:53:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2020-10-24 00:53:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-10-24 00:53:42,196 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:42,196 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-10-24 00:53:42,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:53:42,197 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:42,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1497778840, now seen corresponding path program 5 times [2020-10-24 00:53:42,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:42,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [224745923] [2020-10-24 00:53:42,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:53:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:53:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 375 proven. 413 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2020-10-24 00:53:42,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [224745923] [2020-10-24 00:53:42,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:42,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:53:42,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894115536] [2020-10-24 00:53:42,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:53:42,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:42,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:53:42,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:53:42,824 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand 14 states. [2020-10-24 00:53:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:44,509 INFO L93 Difference]: Finished difference Result 213 states and 326 transitions. [2020-10-24 00:53:44,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 00:53:44,510 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 202 [2020-10-24 00:53:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:44,512 INFO L225 Difference]: With dead ends: 213 [2020-10-24 00:53:44,513 INFO L226 Difference]: Without dead ends: 99 [2020-10-24 00:53:44,517 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-10-24 00:53:44,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-24 00:53:44,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2020-10-24 00:53:44,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-24 00:53:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2020-10-24 00:53:44,538 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 202 [2020-10-24 00:53:44,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:44,539 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2020-10-24 00:53:44,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:53:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2020-10-24 00:53:44,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-10-24 00:53:44,541 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:44,541 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-10-24 00:53:44,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:53:44,542 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:44,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:44,542 INFO L82 PathProgramCache]: Analyzing trace with hash -799639331, now seen corresponding path program 6 times [2020-10-24 00:53:44,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:44,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1499737001] [2020-10-24 00:53:44,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:45,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:45,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:45,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:45,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:45,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:45,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:45,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:53:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:45,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:45,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:45,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:45,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2020-10-24 00:53:45,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1499737001] [2020-10-24 00:53:45,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:45,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 00:53:45,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777590795] [2020-10-24 00:53:45,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 00:53:45,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:45,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 00:53:45,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:53:45,298 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand 17 states. [2020-10-24 00:53:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:47,108 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2020-10-24 00:53:47,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 00:53:47,109 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 149 [2020-10-24 00:53:47,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:47,112 INFO L225 Difference]: With dead ends: 110 [2020-10-24 00:53:47,112 INFO L226 Difference]: Without dead ends: 103 [2020-10-24 00:53:47,113 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2020-10-24 00:53:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-24 00:53:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2020-10-24 00:53:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-24 00:53:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2020-10-24 00:53:47,152 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 149 [2020-10-24 00:53:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:47,152 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2020-10-24 00:53:47,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 00:53:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2020-10-24 00:53:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-10-24 00:53:47,156 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:47,157 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-10-24 00:53:47,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:53:47,157 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:47,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:47,158 INFO L82 PathProgramCache]: Analyzing trace with hash 876241593, now seen corresponding path program 7 times [2020-10-24 00:53:47,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:47,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1895441990] [2020-10-24 00:53:47,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:53:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-10-24 00:53:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 285 proven. 207 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2020-10-24 00:53:47,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1895441990] [2020-10-24 00:53:47,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:47,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:53:47,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035812733] [2020-10-24 00:53:47,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:53:47,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:47,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:53:47,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:53:47,584 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand 11 states. [2020-10-24 00:53:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:48,518 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2020-10-24 00:53:48,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 00:53:48,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 184 [2020-10-24 00:53:48,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:48,521 INFO L225 Difference]: With dead ends: 176 [2020-10-24 00:53:48,521 INFO L226 Difference]: Without dead ends: 92 [2020-10-24 00:53:48,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2020-10-24 00:53:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-24 00:53:48,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-24 00:53:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-24 00:53:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2020-10-24 00:53:48,547 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 184 [2020-10-24 00:53:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:48,548 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2020-10-24 00:53:48,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:53:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2020-10-24 00:53:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-10-24 00:53:48,551 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:48,551 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-10-24 00:53:48,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:53:48,552 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:48,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:48,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1677663584, now seen corresponding path program 8 times [2020-10-24 00:53:48,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:48,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1845979425] [2020-10-24 00:53:48,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:53:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:53:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:48,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:49,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 391 proven. 334 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2020-10-24 00:53:49,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1845979425] [2020-10-24 00:53:49,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:49,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:53:49,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396317784] [2020-10-24 00:53:49,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:53:49,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:49,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:53:49,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:53:49,142 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 14 states. [2020-10-24 00:53:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:50,643 INFO L93 Difference]: Finished difference Result 172 states and 214 transitions. [2020-10-24 00:53:50,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:53:50,644 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 202 [2020-10-24 00:53:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:50,645 INFO L225 Difference]: With dead ends: 172 [2020-10-24 00:53:50,645 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:53:50,647 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-10-24 00:53:50,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:53:50,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:53:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:53:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:53:50,647 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 202 [2020-10-24 00:53:50,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:50,648 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:53:50,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:53:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:53:50,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:53:50,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:53:50,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:53:53,302 WARN L193 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 39 [2020-10-24 00:53:54,018 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 31 [2020-10-24 00:53:54,177 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 6 [2020-10-24 00:53:54,644 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 34 [2020-10-24 00:53:55,258 WARN L193 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 39 [2020-10-24 00:53:55,715 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 52 [2020-10-24 00:53:55,824 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 6 [2020-10-24 00:53:56,240 WARN L193 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2020-10-24 00:53:56,680 WARN L193 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2020-10-24 00:53:57,098 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 31 [2020-10-24 00:53:57,203 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-10-24 00:53:57,203 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-10-24 00:53:57,203 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:53:57,203 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-10-24 00:53:57,204 INFO L277 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-10-24 00:53:57,204 INFO L277 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-10-24 00:53:57,204 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:53:57,204 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 00:53:57,204 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:53:57,204 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:53:57,204 INFO L277 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-10-24 00:53:57,205 INFO L277 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-10-24 00:53:57,205 INFO L277 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-10-24 00:53:57,205 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:53:57,205 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:53:57,205 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:53:57,205 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 00:53:57,205 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 00:53:57,205 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 25 32) the Hoare annotation is: true [2020-10-24 00:53:57,206 INFO L270 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: false [2020-10-24 00:53:57,206 INFO L270 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-10-24 00:53:57,206 INFO L270 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: false [2020-10-24 00:53:57,206 INFO L270 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0)) [2020-10-24 00:53:57,206 INFO L270 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-10-24 00:53:57,206 INFO L270 CegarLoopResult]: At program point L28-2(lines 28 30) the Hoare annotation is: (<= 5 main_~x~0) [2020-10-24 00:53:57,206 INFO L270 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-10-24 00:53:57,206 INFO L270 CegarLoopResult]: At program point mainEXIT(lines 25 32) the Hoare annotation is: (<= 5 main_~x~0) [2020-10-24 00:53:57,206 INFO L270 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-10-24 00:53:57,207 INFO L270 CegarLoopResult]: At program point mainFINAL(lines 25 32) the Hoare annotation is: (<= 5 main_~x~0) [2020-10-24 00:53:57,207 INFO L270 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-10-24 00:53:57,207 INFO L270 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-10-24 00:53:57,207 INFO L270 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 2 |fibo_#in~n|) (= fibo_~n |fibo_#in~n|)) [2020-10-24 00:53:57,207 INFO L270 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-10-24 00:53:57,207 INFO L270 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-10-24 00:53:57,207 INFO L270 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-10-24 00:53:57,208 INFO L270 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (< 0 fibo_~n) (= fibo_~n |fibo_#in~n|)) [2020-10-24 00:53:57,208 INFO L270 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-10-24 00:53:57,208 INFO L270 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (<= |fibo_#in~n| 0) (= fibo_~n |fibo_#in~n|)) [2020-10-24 00:53:57,208 INFO L270 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-10-24 00:53:57,208 INFO L270 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo_~n |fibo_#in~n|) [2020-10-24 00:53:57,209 INFO L270 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|)) (.cse5 (<= |fibo_#in~n| 2)) (.cse1 (= fibo_~n |fibo_#in~n|))) (let ((.cse4 (and (<= 1 |fibo_#res|) .cse2 (<= 1 .cse0) (<= .cse0 1) .cse3 (<= |fibo_#res| 1) .cse5 .cse1))) (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)) (and (<= 5 |fibo_#res|) (<= 5 .cse0) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse1 (<= 3 |fibo_#t~ret7|) (<= .cse0 5) (<= |fibo_#res| 5)) .cse4 (and (<= 6 fibo_~n) .cse1)) (or (not .cse5) .cse4) (not (<= |fibo_#in~n| 1))))) [2020-10-24 00:53:57,209 INFO L270 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (let ((.cse2 (<= |fibo_#in~n| 2)) (.cse0 (= fibo_~n |fibo_#in~n|))) (let ((.cse1 (and (<= 1 |fibo_#res|) (<= 2 |fibo_#in~n|) (<= |fibo_#res| 1) .cse2 .cse0))) (and (or (and (<= |fibo_#in~n| 4) (<= |fibo_#res| 3) .cse0 (<= 3 |fibo_#res|) (<= 4 |fibo_#in~n|)) .cse1 (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2) .cse0 (<= |fibo_#in~n| 3)) (and (<= 5 |fibo_#res|) (<= 5 |fibo_#in~n|) .cse0 (<= |fibo_#res| 5)) (and (<= 6 fibo_~n) .cse0)) (or (not .cse2) .cse1)))) [2020-10-24 00:53:57,209 INFO L277 CegarLoopResult]: At program point fiboENTRY(lines 7 15) the Hoare annotation is: true [2020-10-24 00:53:57,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:53:57 BoogieIcfgContainer [2020-10-24 00:53:57,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:53:57,231 INFO L168 Benchmark]: Toolchain (without parser) took 21463.91 ms. Allocated memory was 155.2 MB in the beginning and 330.3 MB in the end (delta: 175.1 MB). Free memory was 131.6 MB in the beginning and 237.5 MB in the end (delta: -105.9 MB). Peak memory consumption was 191.7 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:57,231 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 155.2 MB. Free memory is still 131.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:53:57,232 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.97 ms. Allocated memory is still 155.2 MB. Free memory was 131.1 MB in the beginning and 122.1 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:57,233 INFO L168 Benchmark]: Boogie Preprocessor took 57.83 ms. Allocated memory is still 155.2 MB. Free memory was 122.1 MB in the beginning and 120.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:57,233 INFO L168 Benchmark]: RCFGBuilder took 395.55 ms. Allocated memory is still 155.2 MB. Free memory was 120.6 MB in the beginning and 106.8 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:57,234 INFO L168 Benchmark]: TraceAbstraction took 20635.20 ms. Allocated memory was 155.2 MB in the beginning and 330.3 MB in the end (delta: 175.1 MB). Free memory was 106.5 MB in the beginning and 237.5 MB in the end (delta: -131.0 MB). Peak memory consumption was 166.5 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:57,237 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.24 ms. Allocated memory is still 155.2 MB. Free memory is still 131.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 361.97 ms. Allocated memory is still 155.2 MB. Free memory was 131.1 MB in the beginning and 122.1 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 57.83 ms. Allocated memory is still 155.2 MB. Free memory was 122.1 MB in the beginning and 120.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 395.55 ms. Allocated memory is still 155.2 MB. Free memory was 120.6 MB in the beginning and 106.8 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 20635.20 ms. Allocated memory was 155.2 MB in the beginning and 330.3 MB in the end (delta: 175.1 MB). Free memory was 106.5 MB in the beginning and 237.5 MB in the end (delta: -131.0 MB). Peak memory consumption was 166.5 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: 6.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 448 SDtfs, 765 SDslu, 884 SDs, 0 SdLazy, 2397 SolverSat, 417 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 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, 48 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 811 PreInvPairs, 1357 NumberOfFragments, 944 HoareAnnotationTreeSize, 811 FomulaSimplifications, 35794 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 43 FomulaSimplificationsInter, 16376 FormulaSimplificationTreeSizeReductionInter, 4.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1126 NumberOfCodeBlocks, 1126 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1115 ConstructedInterpolants, 0 QuantifiedInterpolants, 371441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 3526/4958 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...