/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/Fibonacci01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:25:39,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:25:39,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:25:39,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:25:39,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:25:39,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:25:39,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:25:39,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:25:39,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:25:39,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:25:39,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:25:39,792 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:25:39,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:25:39,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:25:39,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:25:39,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:25:39,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:25:39,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:25:39,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:25:39,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:25:39,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:25:39,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:25:39,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:25:39,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:25:39,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:25:39,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:25:39,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:25:39,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:25:39,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:25:39,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:25:39,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:25:39,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:25:39,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:25:39,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:25:39,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:25:39,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:25:39,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:25:39,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:25:39,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:25:39,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:25:39,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:25:39,826 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:39,849 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:25:39,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:25:39,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:25:39,855 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:25:39,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:25:39,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:25:39,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:25:39,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:25:39,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:25:39,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:25:39,858 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:25:39,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:25:39,858 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:25:39,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:25:39,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:25:39,859 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:25:39,860 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:25:39,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:25:39,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:25:39,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:25:39,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:25:39,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:25:39,861 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:40,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:25:40,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:25:40,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:25:40,370 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:25:40,371 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:25:40,372 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-11-07 00:25:40,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de0c2470/408d83ac841e45c0800bb8b42220f2ad/FLAG37d4f8929 [2020-11-07 00:25:41,199 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:25:41,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-11-07 00:25:41,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de0c2470/408d83ac841e45c0800bb8b42220f2ad/FLAG37d4f8929 [2020-11-07 00:25:41,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de0c2470/408d83ac841e45c0800bb8b42220f2ad [2020-11-07 00:25:41,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:25:41,572 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:25:41,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:25:41,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:25:41,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:25:41,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:25:41" (1/1) ... [2020-11-07 00:25:41,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19b15775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:41, skipping insertion in model container [2020-11-07 00:25:41,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:25:41" (1/1) ... [2020-11-07 00:25:41,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:25:41,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:25:41,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:25:41,772 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:25:41,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:25:41,805 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:25:41,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:41 WrapperNode [2020-11-07 00:25:41,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:25:41,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:25:41,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:25:41,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:25:41,820 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:41" (1/1) ... [2020-11-07 00:25:41,821 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:41" (1/1) ... [2020-11-07 00:25:41,827 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:41" (1/1) ... [2020-11-07 00:25:41,827 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:41" (1/1) ... [2020-11-07 00:25:41,833 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:41" (1/1) ... [2020-11-07 00:25:41,835 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:41" (1/1) ... [2020-11-07 00:25:41,836 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:41" (1/1) ... [2020-11-07 00:25:41,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:25:41,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:25:41,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:25:41,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:25:41,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:41" (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:41,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:25:41,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:25:41,913 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:25:41,913 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-11-07 00:25:41,913 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:25:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:25:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:25:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:25:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:25:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:25:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-11-07 00:25:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:25:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:25:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:25:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:25:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:25:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:25:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:25:42,348 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:25:42,348 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:25:42,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:25:42 BoogieIcfgContainer [2020-11-07 00:25:42,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:25:42,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:25:42,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:25:42,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:25:42,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:25:41" (1/3) ... [2020-11-07 00:25:42,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7ebfb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:25:42, skipping insertion in model container [2020-11-07 00:25:42,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:41" (2/3) ... [2020-11-07 00:25:42,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7ebfb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:25:42, skipping insertion in model container [2020-11-07 00:25:42,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:25:42" (3/3) ... [2020-11-07 00:25:42,367 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2020-11-07 00:25:42,385 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:25:42,389 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:25:42,402 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:25:42,439 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:25:42,439 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:25:42,439 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:25:42,439 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:25:42,440 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:25:42,440 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:25:42,440 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:25:42,440 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:25:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-11-07 00:25:42,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-07 00:25:42,480 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:42,481 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:42,482 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:42,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:42,494 INFO L82 PathProgramCache]: Analyzing trace with hash 274389233, now seen corresponding path program 1 times [2020-11-07 00:25:42,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:42,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [985407690] [2020-11-07 00:25:42,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:42,602 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:42,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:42,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:25:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:43,011 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:43,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [985407690] [2020-11-07 00:25:43,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:43,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:25:43,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574167354] [2020-11-07 00:25:43,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:25:43,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:43,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:25:43,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:25:43,047 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 8 states. [2020-11-07 00:25:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:43,582 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2020-11-07 00:25:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:25:43,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-11-07 00:25:43,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:43,595 INFO L225 Difference]: With dead ends: 63 [2020-11-07 00:25:43,595 INFO L226 Difference]: Without dead ends: 40 [2020-11-07 00:25:43,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:25:43,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-11-07 00:25:43,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-11-07 00:25:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-07 00:25:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-11-07 00:25:43,657 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 28 [2020-11-07 00:25:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:43,658 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-11-07 00:25:43,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:25:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-11-07 00:25:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-07 00:25:43,660 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:43,661 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:43,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:25:43,661 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:43,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:43,662 INFO L82 PathProgramCache]: Analyzing trace with hash -393682023, now seen corresponding path program 1 times [2020-11-07 00:25:43,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:43,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1187291243] [2020-11-07 00:25:43,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:43,666 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:43,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:43,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:25:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:43,892 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:43,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1187291243] [2020-11-07 00:25:43,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:43,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:25:43,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808003467] [2020-11-07 00:25:43,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:25:43,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:43,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:25:43,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:25:43,899 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 8 states. [2020-11-07 00:25:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:44,367 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-11-07 00:25:44,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:25:44,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-11-07 00:25:44,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:44,370 INFO L225 Difference]: With dead ends: 49 [2020-11-07 00:25:44,371 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 00:25:44,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:25:44,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 00:25:44,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-11-07 00:25:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-07 00:25:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-11-07 00:25:44,387 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 29 [2020-11-07 00:25:44,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:44,387 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-11-07 00:25:44,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:25:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-11-07 00:25:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 00:25:44,390 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:44,390 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:44,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:25:44,390 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:44,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:44,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1206167652, now seen corresponding path program 1 times [2020-11-07 00:25:44,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:44,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [245609199] [2020-11-07 00:25:44,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:44,395 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:25:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:25:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,533 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:44,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [245609199] [2020-11-07 00:25:44,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:44,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:25:44,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128912101] [2020-11-07 00:25:44,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:25:44,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:44,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:25:44,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:25:44,545 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 7 states. [2020-11-07 00:25:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:44,906 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2020-11-07 00:25:44,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:25:44,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2020-11-07 00:25:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:44,909 INFO L225 Difference]: With dead ends: 65 [2020-11-07 00:25:44,909 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 00:25:44,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:25:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 00:25:44,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-07 00:25:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-07 00:25:44,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2020-11-07 00:25:44,934 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 45 [2020-11-07 00:25:44,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:44,935 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2020-11-07 00:25:44,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:25:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-11-07 00:25:44,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-07 00:25:44,942 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:44,942 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:44,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:25:44,943 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:44,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:44,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1636516106, now seen corresponding path program 1 times [2020-11-07 00:25:44,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:44,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2012940346] [2020-11-07 00:25:44,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:44,953 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:45,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:45,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:25:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:45,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:45,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:45,199 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:45,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2012940346] [2020-11-07 00:25:45,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:45,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:25:45,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307719379] [2020-11-07 00:25:45,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:25:45,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:45,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:25:45,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:25:45,202 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 12 states. [2020-11-07 00:25:46,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:46,115 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2020-11-07 00:25:46,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 00:25:46,116 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2020-11-07 00:25:46,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:46,118 INFO L225 Difference]: With dead ends: 60 [2020-11-07 00:25:46,118 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 00:25:46,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:25:46,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 00:25:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2020-11-07 00:25:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-07 00:25:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2020-11-07 00:25:46,136 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 46 [2020-11-07 00:25:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:46,136 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2020-11-07 00:25:46,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:25:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2020-11-07 00:25:46,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 00:25:46,139 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:46,139 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:46,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:25:46,140 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:46,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:46,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1018144491, now seen corresponding path program 1 times [2020-11-07 00:25:46,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:46,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1012059584] [2020-11-07 00:25:46,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:46,143 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:46,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:46,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:25:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:46,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:46,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:46,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:46,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-07 00:25:46,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1012059584] [2020-11-07 00:25:46,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:46,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:25:46,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997542177] [2020-11-07 00:25:46,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:25:46,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:46,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:25:46,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:25:46,326 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 7 states. [2020-11-07 00:25:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:46,885 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2020-11-07 00:25:46,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:25:46,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2020-11-07 00:25:46,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:46,889 INFO L225 Difference]: With dead ends: 86 [2020-11-07 00:25:46,890 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 00:25:46,891 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:25:46,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 00:25:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-07 00:25:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-07 00:25:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2020-11-07 00:25:46,909 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 65 [2020-11-07 00:25:46,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:46,910 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2020-11-07 00:25:46,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:25:46,910 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-11-07 00:25:46,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 00:25:46,912 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:46,912 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:46,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:25:46,912 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:46,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:46,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1280637961, now seen corresponding path program 2 times [2020-11-07 00:25:46,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:46,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1618695985] [2020-11-07 00:25:46,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:46,916 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:25:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,116 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:47,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1618695985] [2020-11-07 00:25:47,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:47,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:25:47,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193251488] [2020-11-07 00:25:47,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:25:47,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:47,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:25:47,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:25:47,119 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 8 states. [2020-11-07 00:25:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:47,629 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2020-11-07 00:25:47,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:25:47,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2020-11-07 00:25:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:47,631 INFO L225 Difference]: With dead ends: 87 [2020-11-07 00:25:47,631 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 00:25:47,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:25:47,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 00:25:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-07 00:25:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-07 00:25:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2020-11-07 00:25:47,651 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 63 [2020-11-07 00:25:47,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:47,651 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2020-11-07 00:25:47,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:25:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2020-11-07 00:25:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-07 00:25:47,655 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:47,656 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:47,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:25:47,656 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:47,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:47,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1382349825, now seen corresponding path program 3 times [2020-11-07 00:25:47,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:47,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [192002223] [2020-11-07 00:25:47,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:47,661 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:25:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,980 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:47,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [192002223] [2020-11-07 00:25:47,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:47,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:25:47,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466363422] [2020-11-07 00:25:47,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:25:47,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:47,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:25:47,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:25:47,988 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 14 states. [2020-11-07 00:25:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:49,072 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2020-11-07 00:25:49,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 00:25:49,073 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2020-11-07 00:25:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:49,078 INFO L225 Difference]: With dead ends: 70 [2020-11-07 00:25:49,078 INFO L226 Difference]: Without dead ends: 63 [2020-11-07 00:25:49,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2020-11-07 00:25:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-07 00:25:49,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2020-11-07 00:25:49,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-07 00:25:49,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2020-11-07 00:25:49,116 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 64 [2020-11-07 00:25:49,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:49,118 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2020-11-07 00:25:49,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:25:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2020-11-07 00:25:49,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-07 00:25:49,125 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:49,126 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:49,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:25:49,126 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:49,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:49,127 INFO L82 PathProgramCache]: Analyzing trace with hash -234313849, now seen corresponding path program 4 times [2020-11-07 00:25:49,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:49,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1896561677] [2020-11-07 00:25:49,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:49,131 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:25:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 16 proven. 43 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-11-07 00:25:49,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1896561677] [2020-11-07 00:25:49,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:49,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:25:49,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049128856] [2020-11-07 00:25:49,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:25:49,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:49,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:25:49,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:25:49,414 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 9 states. [2020-11-07 00:25:50,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:50,153 INFO L93 Difference]: Finished difference Result 108 states and 137 transitions. [2020-11-07 00:25:50,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:25:50,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2020-11-07 00:25:50,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:50,155 INFO L225 Difference]: With dead ends: 108 [2020-11-07 00:25:50,156 INFO L226 Difference]: Without dead ends: 71 [2020-11-07 00:25:50,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:25:50,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-11-07 00:25:50,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2020-11-07 00:25:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-07 00:25:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2020-11-07 00:25:50,181 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 99 [2020-11-07 00:25:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:50,181 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2020-11-07 00:25:50,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:25:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2020-11-07 00:25:50,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-11-07 00:25:50,183 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:50,184 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:50,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:25:50,184 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:50,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:50,187 INFO L82 PathProgramCache]: Analyzing trace with hash 85893735, now seen corresponding path program 5 times [2020-11-07 00:25:50,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:50,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [587378776] [2020-11-07 00:25:50,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:50,190 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:25:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:25:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:25:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2020-11-07 00:25:50,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [587378776] [2020-11-07 00:25:50,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:50,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:25:50,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820859649] [2020-11-07 00:25:50,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:25:50,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:50,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:25:50,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:25:50,508 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 11 states. [2020-11-07 00:25:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:51,571 INFO L93 Difference]: Finished difference Result 136 states and 179 transitions. [2020-11-07 00:25:51,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 00:25:51,572 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 135 [2020-11-07 00:25:51,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:51,576 INFO L225 Difference]: With dead ends: 136 [2020-11-07 00:25:51,577 INFO L226 Difference]: Without dead ends: 88 [2020-11-07 00:25:51,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2020-11-07 00:25:51,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-11-07 00:25:51,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2020-11-07 00:25:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 00:25:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2020-11-07 00:25:51,604 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 135 [2020-11-07 00:25:51,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:51,604 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2020-11-07 00:25:51,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:25:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2020-11-07 00:25:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-07 00:25:51,606 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:51,606 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:51,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:25:51,607 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:51,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:51,607 INFO L82 PathProgramCache]: Analyzing trace with hash -304626607, now seen corresponding path program 6 times [2020-11-07 00:25:51,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:51,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1350741980] [2020-11-07 00:25:51,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:51,613 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-07 00:25:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:25:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:25:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:25:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:25:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 00:25:52,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1350741980] [2020-11-07 00:25:52,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:52,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 00:25:52,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198548243] [2020-11-07 00:25:52,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 00:25:52,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:52,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 00:25:52,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:25:52,011 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand 16 states. [2020-11-07 00:25:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:53,018 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2020-11-07 00:25:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 00:25:53,018 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 99 [2020-11-07 00:25:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:53,019 INFO L225 Difference]: With dead ends: 79 [2020-11-07 00:25:53,019 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:25:53,022 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2020-11-07 00:25:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:25:53,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:25:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:25:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:25:53,023 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2020-11-07 00:25:53,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:53,023 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:25:53,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 00:25:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:25:53,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:25:53,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:25:53,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:25:55,213 WARN L194 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 24 [2020-11-07 00:25:55,392 WARN L194 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 16 [2020-11-07 00:25:55,665 WARN L194 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 16 [2020-11-07 00:25:55,891 WARN L194 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 28 [2020-11-07 00:25:56,164 WARN L194 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 19 [2020-11-07 00:25:56,591 WARN L194 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 19 [2020-11-07 00:25:56,746 WARN L194 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 9 [2020-11-07 00:25:57,332 WARN L194 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 24 [2020-11-07 00:25:57,482 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 6 [2020-11-07 00:25:57,712 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 00:25:57,712 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 00:25:57,713 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:25:57,713 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 00:25:57,713 INFO L262 CegarLoopResult]: At program point fibonacciFINAL(lines 16 24) the Hoare annotation is: (let ((.cse1 (<= |fibonacci_#in~n| 0))) (let ((.cse2 (or (and .cse1 (<= |fibonacci_#res| 0)) (and (<= 1 |fibonacci_#res|) (<= |fibonacci_#res| 1)))) (.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 .cse1 (<= 0 |fibonacci_#res|) .cse2) (and (<= 1 |fibonacci_#in~n|) (<= |fibonacci_#in~n| 1) .cse0 .cse2) (and .cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)) (<= 2 |fibonacci_#in~n|))))) [2020-11-07 00:25:57,713 INFO L269 CegarLoopResult]: At program point fibonacciENTRY(lines 16 24) the Hoare annotation is: true [2020-11-07 00:25:57,713 INFO L262 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (<= 2 |fibonacci_#in~n|)) [2020-11-07 00:25:57,714 INFO L262 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 (<= 3 |fibonacci_#in~n|) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))) (and (<= |fibonacci_#in~n| 2) .cse0 (<= 1 |fibonacci_#t~ret7|) (<= 2 |fibonacci_#in~n|)))) [2020-11-07 00:25:57,714 INFO L262 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= 1 |fibonacci_#in~n|) (<= |fibonacci_#in~n| 1) (= fibonacci_~n |fibonacci_#in~n|)) [2020-11-07 00:25:57,714 INFO L262 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 (<= 3 |fibonacci_#in~n|) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))) (and (<= |fibonacci_#in~n| 2) .cse0 (<= 1 |fibonacci_#t~ret7|) (<= 2 |fibonacci_#in~n|)))) [2020-11-07 00:25:57,714 INFO L262 CegarLoopResult]: At program point L19(lines 19 23) the Hoare annotation is: (and (<= 1 |fibonacci_#in~n|) (= fibonacci_~n |fibonacci_#in~n|)) [2020-11-07 00:25:57,715 INFO L262 CegarLoopResult]: At program point L22-3(line 22) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|)) (.cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| |fibonacci_#t~ret8| 1)))) (or (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 1)) .cse0 .cse1 (<= 2 |fibonacci_#in~n|)) (and (<= 3 fibonacci_~n) .cse0 .cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))))) [2020-11-07 00:25:57,715 INFO L262 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (<= |fibonacci_#in~n| 0)) [2020-11-07 00:25:57,715 INFO L262 CegarLoopResult]: At program point L22-4(line 22) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|)) (.cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| |fibonacci_#t~ret8| 1)))) (or (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 1)) .cse0 .cse1 (<= 2 |fibonacci_#in~n|)) (and (<= 3 fibonacci_~n) .cse0 .cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))))) [2020-11-07 00:25:57,715 INFO L262 CegarLoopResult]: At program point fibonacciEXIT(lines 16 24) the Hoare annotation is: (let ((.cse1 (<= |fibonacci_#in~n| 0))) (let ((.cse2 (or (and .cse1 (<= |fibonacci_#res| 0)) (and (<= 1 |fibonacci_#res|) (<= |fibonacci_#res| 1)))) (.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 .cse1 (<= 0 |fibonacci_#res|) .cse2) (and (<= 1 |fibonacci_#in~n|) (<= |fibonacci_#in~n| 1) .cse0 .cse2) (and .cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)) (<= 2 |fibonacci_#in~n|))))) [2020-11-07 00:25:57,715 INFO L262 CegarLoopResult]: At program point L17(lines 17 23) the Hoare annotation is: (= fibonacci_~n |fibonacci_#in~n|) [2020-11-07 00:25:57,716 INFO L262 CegarLoopResult]: At program point L22-5(line 22) the Hoare annotation is: (and (not (<= |fibonacci_#in~n| 1)) (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|)) (.cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)))) (or (and .cse0 .cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| |fibonacci_#t~ret8| 1)) (<= 3 |fibonacci_#in~n|) (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))) (and (<= fibonacci_~n 2) (<= 1 (+ |fibonacci_#t~ret7| |fibonacci_#t~ret8|)) .cse0 .cse1 (<= 1 |fibonacci_#t~ret7|))))) [2020-11-07 00:25:57,716 INFO L262 CegarLoopResult]: At program point L22-6(line 22) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)) (< 1 fibonacci_~n)) [2020-11-07 00:25:57,716 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 00:25:57,716 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 00:25:57,716 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:25:57,716 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 00:25:57,717 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:25:57,717 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:25:57,717 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:25:57,717 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 00:25:57,717 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 00:25:57,717 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:25:57,717 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:25:57,718 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:25:57,718 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:25:57,718 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:25:57,718 INFO L262 CegarLoopResult]: At program point L33(lines 33 37) the Hoare annotation is: (<= main_~x~0 (+ main_~result~0 1)) [2020-11-07 00:25:57,718 INFO L269 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-11-07 00:25:57,718 INFO L262 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (<= main_~x~0 (+ |main_#t~ret10| 1)) [2020-11-07 00:25:57,718 INFO L269 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-11-07 00:25:57,718 INFO L262 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: (<= main_~x~0 (+ |main_#t~ret10| 1)) [2020-11-07 00:25:57,719 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 27 38) the Hoare annotation is: true [2020-11-07 00:25:57,719 INFO L269 CegarLoopResult]: At program point L29(lines 29 31) the Hoare annotation is: true [2020-11-07 00:25:57,719 INFO L262 CegarLoopResult]: At program point L32-3(line 32) the Hoare annotation is: (and (<= main_~x~0 (+ main_~result~0 1)) (<= main_~x~0 (+ |main_#t~ret10| 1))) [2020-11-07 00:25:57,719 INFO L269 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-11-07 00:25:57,719 INFO L269 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-11-07 00:25:57,719 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 27 38) the Hoare annotation is: true [2020-11-07 00:25:57,719 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 27 38) the Hoare annotation is: true [2020-11-07 00:25:57,719 INFO L262 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: false [2020-11-07 00:25:57,720 INFO L262 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: false [2020-11-07 00:25:57,720 INFO L269 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-11-07 00:25:57,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:25:57 BoogieIcfgContainer [2020-11-07 00:25:57,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:25:57,741 INFO L168 Benchmark]: Toolchain (without parser) took 16174.03 ms. Allocated memory was 165.7 MB in the beginning and 253.8 MB in the end (delta: 88.1 MB). Free memory was 141.6 MB in the beginning and 207.8 MB in the end (delta: -66.3 MB). Peak memory consumption was 149.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:25:57,742 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 125.8 MB. Free memory is still 82.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:25:57,743 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.31 ms. Allocated memory is still 165.7 MB. Free memory was 140.9 MB in the beginning and 131.8 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:57,743 INFO L168 Benchmark]: Boogie Preprocessor took 30.82 ms. Allocated memory is still 165.7 MB. Free memory was 131.8 MB in the beginning and 130.4 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:57,744 INFO L168 Benchmark]: RCFGBuilder took 514.80 ms. Allocated memory is still 165.7 MB. Free memory was 130.4 MB in the beginning and 115.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-11-07 00:25:57,745 INFO L168 Benchmark]: TraceAbstraction took 15382.35 ms. Allocated memory was 165.7 MB in the beginning and 253.8 MB in the end (delta: 88.1 MB). Free memory was 115.5 MB in the beginning and 207.8 MB in the end (delta: -92.3 MB). Peak memory consumption was 122.7 MB. Max. memory is 8.0 GB. [2020-11-07 00:25:57,748 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.26 ms. Allocated memory is still 125.8 MB. Free memory is still 82.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 229.31 ms. Allocated memory is still 165.7 MB. Free memory was 140.9 MB in the beginning and 131.8 MB in the end (delta: 9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 30.82 ms. Allocated memory is still 165.7 MB. Free memory was 131.8 MB in the beginning and 130.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 514.80 ms. Allocated memory is still 165.7 MB. Free memory was 130.4 MB in the beginning and 115.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15382.35 ms. Allocated memory was 165.7 MB in the beginning and 253.8 MB in the end (delta: 88.1 MB). Free memory was 115.5 MB in the beginning and 207.8 MB in the end (delta: -92.3 MB). Peak memory consumption was 122.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for fibonacci Derived contract for procedure fibonacci: ((((n == \old(n) && \old(n) <= 0) && 0 <= \result) && ((\old(n) <= 0 && \result <= 0) || (1 <= \result && \result <= 1))) || (((1 <= \old(n) && \old(n) <= 1) && n == \old(n)) && ((\old(n) <= 0 && \result <= 0) || (1 <= \result && \result <= 1)))) || ((n == \old(n) && \old(n) <= \result + 1) && 2 <= \old(n)) - ProcedureContractResult [Line: 27]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.5s, OverallIterations: 10, TraceHistogramMax: 13, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 354 SDtfs, 633 SDslu, 832 SDs, 0 SdLazy, 1763 SolverSat, 274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 29 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 47 LocationsWithAnnotation, 419 PreInvPairs, 708 NumberOfFragments, 433 HoareAnnotationTreeSize, 419 FomulaSimplifications, 40121 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 47 FomulaSimplificationsInter, 10882 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...