/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci04.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:25:42,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:25:42,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:25:42,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:25:42,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:25:42,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:25:42,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:25:42,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:25:42,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:25:42,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:25:42,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:25:42,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:25:42,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:25:42,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:25:42,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:25:42,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:25:42,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:25:42,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:25:42,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:25:42,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:25:42,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:25:42,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:25:42,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:25:42,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:25:42,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:25:42,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:25:42,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:25:42,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:25:42,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:25:42,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:25:42,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:25:42,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:25:42,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:25:42,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:25:42,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:25:42,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:25:42,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:25:42,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:25:42,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:25:42,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:25:42,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:25:42,818 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:25:42,831 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:25:42,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:25:42,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:25:42,833 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:25:42,833 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:25:42,833 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:25:42,833 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:25:42,834 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:25:42,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:25:42,834 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:25:42,834 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:25:42,834 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:25:42,835 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:25:42,835 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:25:42,835 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:25:42,835 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:25:42,835 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:25:42,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:25:42,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:25:42,836 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:25:42,836 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:25:42,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:25:42,837 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-07 00:25:43,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:25:43,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:25:43,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:25:43,269 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:25:43,270 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:25:43,271 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2020-11-07 00:25:43,347 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed09d2675/8e193339538e4574aa388f9543be1076/FLAG166431f92 [2020-11-07 00:25:43,937 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:25:43,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2020-11-07 00:25:43,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed09d2675/8e193339538e4574aa388f9543be1076/FLAG166431f92 [2020-11-07 00:25:44,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed09d2675/8e193339538e4574aa388f9543be1076 [2020-11-07 00:25:44,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:25:44,308 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:25:44,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:25:44,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:25:44,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:25:44,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:25:44" (1/1) ... [2020-11-07 00:25:44,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ddce888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:44, skipping insertion in model container [2020-11-07 00:25:44,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:25:44" (1/1) ... [2020-11-07 00:25:44,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:25:44,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:25:44,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:25:44,526 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:25:44,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:25:44,561 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:25:44,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:44 WrapperNode [2020-11-07 00:25:44,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:25:44,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:25:44,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:25:44,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:25:44,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:44" (1/1) ... [2020-11-07 00:25:44,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:44" (1/1) ... [2020-11-07 00:25:44,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:44" (1/1) ... [2020-11-07 00:25:44,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:44" (1/1) ... [2020-11-07 00:25:44,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:44" (1/1) ... [2020-11-07 00:25:44,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:44" (1/1) ... [2020-11-07 00:25:44,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:44" (1/1) ... [2020-11-07 00:25:44,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:25:44,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:25:44,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:25:44,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:25:44,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:25:44,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:25:44,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:25:44,703 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:25:44,704 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-11-07 00:25:44,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:25:44,704 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:25:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:25:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:25:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:25:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:25:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-11-07 00:25:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:25:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:25:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:25:44,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:25:44,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:25:44,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:25:44,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:25:45,180 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:25:45,181 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:25:45,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:25:45 BoogieIcfgContainer [2020-11-07 00:25:45,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:25:45,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:25:45,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:25:45,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:25:45,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:25:44" (1/3) ... [2020-11-07 00:25:45,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6344e7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:25:45, skipping insertion in model container [2020-11-07 00:25:45,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:44" (2/3) ... [2020-11-07 00:25:45,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6344e7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:25:45, skipping insertion in model container [2020-11-07 00:25:45,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:25:45" (3/3) ... [2020-11-07 00:25:45,193 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2020-11-07 00:25:45,210 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:25:45,214 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:25:45,229 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:25:45,257 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:25:45,258 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:25:45,258 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:25:45,258 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:25:45,258 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:25:45,258 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:25:45,259 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:25:45,288 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:25:45,305 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-11-07 00:25:45,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-07 00:25:45,316 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:45,317 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:45,317 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:45,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:45,325 INFO L82 PathProgramCache]: Analyzing trace with hash 496375619, now seen corresponding path program 1 times [2020-11-07 00:25:45,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:45,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [19846326] [2020-11-07 00:25:45,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:45,420 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:45,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:45,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:25:45,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [19846326] [2020-11-07 00:25:45,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:45,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:25:45,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439464953] [2020-11-07 00:25:45,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:25:45,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:45,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:25:45,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:25:45,756 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 6 states. [2020-11-07 00:25:46,053 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-11-07 00:25:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:46,419 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2020-11-07 00:25:46,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:25:46,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-07 00:25:46,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:46,433 INFO L225 Difference]: With dead ends: 61 [2020-11-07 00:25:46,433 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 00:25:46,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:25:46,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 00:25:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 00:25:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 00:25:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 00:25:46,499 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 27 [2020-11-07 00:25:46,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:46,500 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 00:25:46,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:25:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 00:25:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-07 00:25:46,503 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:46,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:46,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:25:46,504 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:46,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:46,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1977921721, now seen corresponding path program 1 times [2020-11-07 00:25:46,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:46,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1721289354] [2020-11-07 00:25:46,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:46,510 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:46,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:46,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:25:46,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1721289354] [2020-11-07 00:25:46,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:46,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:25:46,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831403948] [2020-11-07 00:25:46,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:25:46,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:46,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:25:46,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:25:46,701 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2020-11-07 00:25:47,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:47,123 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-11-07 00:25:47,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:25:47,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-11-07 00:25:47,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:47,127 INFO L225 Difference]: With dead ends: 48 [2020-11-07 00:25:47,127 INFO L226 Difference]: Without dead ends: 41 [2020-11-07 00:25:47,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:25:47,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-11-07 00:25:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2020-11-07 00:25:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 00:25:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 00:25:47,156 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2020-11-07 00:25:47,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:47,157 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 00:25:47,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:25:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 00:25:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-07 00:25:47,162 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:47,162 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:47,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:25:47,162 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:47,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:47,166 INFO L82 PathProgramCache]: Analyzing trace with hash -788452534, now seen corresponding path program 1 times [2020-11-07 00:25:47,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:47,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1510217004] [2020-11-07 00:25:47,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:47,172 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:25:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 00:25:47,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1510217004] [2020-11-07 00:25:47,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:47,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:25:47,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313942696] [2020-11-07 00:25:47,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:25:47,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:47,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:25:47,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:25:47,390 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-11-07 00:25:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:47,895 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2020-11-07 00:25:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:25:47,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-11-07 00:25:47,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:47,898 INFO L225 Difference]: With dead ends: 64 [2020-11-07 00:25:47,898 INFO L226 Difference]: Without dead ends: 41 [2020-11-07 00:25:47,899 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-11-07 00:25:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-11-07 00:25:47,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-11-07 00:25:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-07 00:25:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-11-07 00:25:47,914 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 44 [2020-11-07 00:25:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:47,915 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-11-07 00:25:47,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:25:47,915 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-11-07 00:25:47,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 00:25:47,917 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:47,917 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:47,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:25:47,917 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:47,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:47,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1354967602, now seen corresponding path program 1 times [2020-11-07 00:25:47,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:47,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1293834246] [2020-11-07 00:25:47,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:47,921 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 00:25:48,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1293834246] [2020-11-07 00:25:48,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:48,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:25:48,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917974902] [2020-11-07 00:25:48,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:25:48,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:48,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:25:48,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:25:48,095 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2020-11-07 00:25:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:48,863 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2020-11-07 00:25:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:25:48,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2020-11-07 00:25:48,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:48,869 INFO L225 Difference]: With dead ends: 68 [2020-11-07 00:25:48,869 INFO L226 Difference]: Without dead ends: 61 [2020-11-07 00:25:48,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:25:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-11-07 00:25:48,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-11-07 00:25:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 00:25:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-11-07 00:25:48,893 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 45 [2020-11-07 00:25:48,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:48,894 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-11-07 00:25:48,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:25:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-11-07 00:25:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 00:25:48,897 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:48,897 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:48,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:25:48,898 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:48,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:48,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2028047931, now seen corresponding path program 2 times [2020-11-07 00:25:48,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:48,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1614330668] [2020-11-07 00:25:48,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:48,902 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 00:25:49,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1614330668] [2020-11-07 00:25:49,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:49,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:25:49,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981448944] [2020-11-07 00:25:49,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:25:49,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:49,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:25:49,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:25:49,215 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2020-11-07 00:25:49,628 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-11-07 00:25:50,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:50,017 INFO L93 Difference]: Finished difference Result 120 states and 163 transitions. [2020-11-07 00:25:50,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:25:50,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2020-11-07 00:25:50,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:50,021 INFO L225 Difference]: With dead ends: 120 [2020-11-07 00:25:50,021 INFO L226 Difference]: Without dead ends: 75 [2020-11-07 00:25:50,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:25:50,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-07 00:25:50,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2020-11-07 00:25:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-07 00:25:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2020-11-07 00:25:50,061 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 62 [2020-11-07 00:25:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:50,062 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2020-11-07 00:25:50,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:25:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2020-11-07 00:25:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 00:25:50,068 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:50,069 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:50,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:25:50,069 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:50,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:50,070 INFO L82 PathProgramCache]: Analyzing trace with hash -64263789, now seen corresponding path program 3 times [2020-11-07 00:25:50,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:50,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1272608827] [2020-11-07 00:25:50,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:50,075 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-07 00:25:50,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1272608827] [2020-11-07 00:25:50,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:50,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:25:50,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38978031] [2020-11-07 00:25:50,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:25:50,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:50,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:25:50,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:25:50,417 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand 8 states. [2020-11-07 00:25:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:51,245 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2020-11-07 00:25:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:25:51,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2020-11-07 00:25:51,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:51,257 INFO L225 Difference]: With dead ends: 98 [2020-11-07 00:25:51,257 INFO L226 Difference]: Without dead ends: 91 [2020-11-07 00:25:51,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:25:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-07 00:25:51,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2020-11-07 00:25:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-07 00:25:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2020-11-07 00:25:51,331 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 63 [2020-11-07 00:25:51,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:51,332 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2020-11-07 00:25:51,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:25:51,332 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2020-11-07 00:25:51,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-07 00:25:51,344 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:51,344 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:51,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:25:51,345 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:51,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:51,346 INFO L82 PathProgramCache]: Analyzing trace with hash -143796757, now seen corresponding path program 4 times [2020-11-07 00:25:51,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:51,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [752885329] [2020-11-07 00:25:51,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:51,352 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:25:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:25:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,725 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-11-07 00:25:51,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [752885329] [2020-11-07 00:25:51,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:51,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:25:51,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059867783] [2020-11-07 00:25:51,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:25:51,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:51,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:25:51,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:25:51,728 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 9 states. [2020-11-07 00:25:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:52,783 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2020-11-07 00:25:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:25:52,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2020-11-07 00:25:52,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:52,788 INFO L225 Difference]: With dead ends: 148 [2020-11-07 00:25:52,788 INFO L226 Difference]: Without dead ends: 141 [2020-11-07 00:25:52,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:25:52,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-11-07 00:25:52,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2020-11-07 00:25:52,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-11-07 00:25:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 179 transitions. [2020-11-07 00:25:52,827 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 179 transitions. Word has length 134 [2020-11-07 00:25:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:52,828 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 179 transitions. [2020-11-07 00:25:52,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:25:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 179 transitions. [2020-11-07 00:25:52,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-11-07 00:25:52,832 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:52,832 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, 1, 1] [2020-11-07 00:25:52,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:25:52,833 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:52,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:52,833 INFO L82 PathProgramCache]: Analyzing trace with hash 91119029, now seen corresponding path program 5 times [2020-11-07 00:25:52,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:52,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1694158460] [2020-11-07 00:25:52,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:52,837 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:52,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:52,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 00:25:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:25:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:25:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:25:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:25:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 116 proven. 39 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2020-11-07 00:25:53,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1694158460] [2020-11-07 00:25:53,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:53,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:25:53,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087494225] [2020-11-07 00:25:53,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:25:53,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:53,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:25:53,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:25:53,402 INFO L87 Difference]: Start difference. First operand 129 states and 179 transitions. Second operand 11 states. [2020-11-07 00:25:54,350 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-11-07 00:25:55,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:55,216 INFO L93 Difference]: Finished difference Result 430 states and 765 transitions. [2020-11-07 00:25:55,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:25:55,216 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 204 [2020-11-07 00:25:55,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:55,220 INFO L225 Difference]: With dead ends: 430 [2020-11-07 00:25:55,220 INFO L226 Difference]: Without dead ends: 159 [2020-11-07 00:25:55,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:25:55,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-11-07 00:25:55,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2020-11-07 00:25:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-11-07 00:25:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 188 transitions. [2020-11-07 00:25:55,274 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 188 transitions. Word has length 204 [2020-11-07 00:25:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:55,275 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 188 transitions. [2020-11-07 00:25:55,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:25:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 188 transitions. [2020-11-07 00:25:55,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-11-07 00:25:55,279 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:55,279 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, 1, 1] [2020-11-07 00:25:55,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:25:55,279 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:55,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:55,280 INFO L82 PathProgramCache]: Analyzing trace with hash -465623392, now seen corresponding path program 6 times [2020-11-07 00:25:55,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:55,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [72259623] [2020-11-07 00:25:55,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:55,283 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:25:55,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:25:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:25:55,327 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:25:55,373 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 00:25:55,373 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 00:25:55,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:25:55,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:25:55 BoogieIcfgContainer [2020-11-07 00:25:55,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:25:55,401 INFO L168 Benchmark]: Toolchain (without parser) took 11097.53 ms. Allocated memory was 152.0 MB in the beginning and 225.4 MB in the end (delta: 73.4 MB). Free memory was 128.4 MB in the beginning and 164.5 MB in the end (delta: -36.1 MB). Peak memory consumption was 38.3 MB. Max. memory is 8.0 GB. [2020-11-07 00:25:55,402 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 152.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:25:55,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.69 ms. Allocated memory is still 152.0 MB. Free memory was 127.7 MB in the beginning and 118.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:25:55,403 INFO L168 Benchmark]: Boogie Preprocessor took 38.71 ms. Allocated memory is still 152.0 MB. Free memory was 118.5 MB in the beginning and 117.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:25:55,404 INFO L168 Benchmark]: RCFGBuilder took 580.15 ms. Allocated memory is still 152.0 MB. Free memory was 117.2 MB in the beginning and 103.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:25:55,405 INFO L168 Benchmark]: TraceAbstraction took 10214.16 ms. Allocated memory was 152.0 MB in the beginning and 225.4 MB in the end (delta: 73.4 MB). Free memory was 102.8 MB in the beginning and 164.5 MB in the end (delta: -61.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:25:55,408 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.27 ms. Allocated memory is still 152.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 252.69 ms. Allocated memory is still 152.0 MB. Free memory was 127.7 MB in the beginning and 118.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 38.71 ms. Allocated memory is still 152.0 MB. Free memory was 118.5 MB in the beginning and 117.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 580.15 ms. Allocated memory is still 152.0 MB. Free memory was 117.2 MB in the beginning and 103.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10214.16 ms. Allocated memory was 152.0 MB in the beginning and 225.4 MB in the end (delta: 73.4 MB). Free memory was 102.8 MB in the beginning and 164.5 MB in the end (delta: -61.7 MB). Peak memory consumption was 13.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L30] int x = __VERIFIER_nondet_int(); [L31] CALL, EXPR fibonacci(x) [L19] COND FALSE !(n < 1) [L21] COND FALSE !(n == 1) [L24] CALL, EXPR fibonacci(n-1) [L19] COND FALSE !(n < 1) [L21] COND FALSE !(n == 1) [L24] CALL, EXPR fibonacci(n-1) [L19] COND FALSE !(n < 1) [L21] COND FALSE !(n == 1) [L24] CALL, EXPR fibonacci(n-1) [L19] COND FALSE !(n < 1) [L21] COND FALSE !(n == 1) [L24] CALL, EXPR fibonacci(n-1) [L19] COND FALSE !(n < 1) [L21] COND TRUE n == 1 [L22] return 1; [L24] RET, EXPR fibonacci(n-1) [L24] CALL, EXPR fibonacci(n-2) [L19] COND TRUE n < 1 [L20] return 0; [L24] RET, EXPR fibonacci(n-2) [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) [L24] CALL, EXPR fibonacci(n-2) [L19] COND FALSE !(n < 1) [L21] COND TRUE n == 1 [L22] return 1; [L24] RET, EXPR fibonacci(n-2) [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) [L24] CALL, EXPR fibonacci(n-2) [L19] COND FALSE !(n < 1) [L21] COND FALSE !(n == 1) [L24] CALL, EXPR fibonacci(n-1) [L19] COND FALSE !(n < 1) [L21] COND TRUE n == 1 [L22] return 1; [L24] RET, EXPR fibonacci(n-1) [L24] CALL, EXPR fibonacci(n-2) [L19] COND TRUE n < 1 [L20] return 0; [L24] RET, EXPR fibonacci(n-2) [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) [L24] CALL, EXPR fibonacci(n-2) [L19] COND FALSE !(n < 1) [L21] COND FALSE !(n == 1) [L24] CALL, EXPR fibonacci(n-1) [L19] COND FALSE !(n < 1) [L21] COND FALSE !(n == 1) [L24] CALL, EXPR fibonacci(n-1) [L19] COND FALSE !(n < 1) [L21] COND TRUE n == 1 [L22] return 1; [L24] RET, EXPR fibonacci(n-1) [L24] CALL, EXPR fibonacci(n-2) [L19] COND TRUE n < 1 [L20] return 0; [L24] RET, EXPR fibonacci(n-2) [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) [L24] CALL, EXPR fibonacci(n-2) [L19] COND FALSE !(n < 1) [L21] COND TRUE n == 1 [L22] return 1; [L24] RET, EXPR fibonacci(n-2) [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) [L24] return fibonacci(n-1) + fibonacci(n-2); [L31] RET, EXPR fibonacci(x) [L31] int result = fibonacci(x); [L32] COND FALSE !(x != 5 || result == 3) [L35] CALL reach_error() [L3] __assert_fail("0", "Fibonacci04.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.1s, OverallIterations: 9, TraceHistogramMax: 21, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 324 SDtfs, 459 SDslu, 430 SDs, 0 SdLazy, 1100 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...