./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 15:10:22,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 15:10:22,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 15:10:22,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 15:10:22,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 15:10:22,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 15:10:22,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 15:10:22,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 15:10:22,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 15:10:22,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 15:10:22,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 15:10:22,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 15:10:22,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 15:10:22,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 15:10:22,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 15:10:22,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 15:10:22,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 15:10:22,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 15:10:22,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 15:10:22,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 15:10:22,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 15:10:22,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 15:10:22,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 15:10:22,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 15:10:22,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 15:10:22,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 15:10:22,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 15:10:22,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 15:10:22,740 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 15:10:22,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 15:10:22,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 15:10:22,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 15:10:22,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 15:10:22,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 15:10:22,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 15:10:22,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 15:10:22,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 15:10:22,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 15:10:22,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 15:10:22,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 15:10:22,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 15:10:22,748 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 15:10:22,766 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 15:10:22,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 15:10:22,769 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 15:10:22,769 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 15:10:22,770 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 15:10:22,770 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 15:10:22,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 15:10:22,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 15:10:22,770 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 15:10:22,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 15:10:22,771 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 15:10:22,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 15:10:22,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 15:10:22,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 15:10:22,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 15:10:22,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 15:10:22,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 15:10:22,772 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 15:10:22,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 15:10:22,772 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 15:10:22,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 15:10:22,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 15:10:22,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 15:10:22,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 15:10:22,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:10:22,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 15:10:22,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 15:10:22,773 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 15:10:22,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 15:10:22,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 15:10:22,774 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 15:10:22,774 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 15:10:22,774 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 15:10:22,774 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 15:10:22,774 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd [2021-12-17 15:10:22,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 15:10:22,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 15:10:22,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 15:10:22,950 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 15:10:22,953 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 15:10:22,961 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2021-12-17 15:10:23,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75cf7240/de6194c0a64149e1ac72a9576def5891/FLAGd0a99736c [2021-12-17 15:10:23,309 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 15:10:23,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2021-12-17 15:10:23,314 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75cf7240/de6194c0a64149e1ac72a9576def5891/FLAGd0a99736c [2021-12-17 15:10:23,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75cf7240/de6194c0a64149e1ac72a9576def5891 [2021-12-17 15:10:23,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 15:10:23,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 15:10:23,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 15:10:23,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 15:10:23,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 15:10:23,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:10:23" (1/1) ... [2021-12-17 15:10:23,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d05dec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:23, skipping insertion in model container [2021-12-17 15:10:23,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:10:23" (1/1) ... [2021-12-17 15:10:23,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 15:10:23,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 15:10:23,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-12-17 15:10:23,936 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:10:23,945 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 15:10:23,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-12-17 15:10:23,969 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:10:23,980 INFO L208 MainTranslator]: Completed translation [2021-12-17 15:10:23,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:23 WrapperNode [2021-12-17 15:10:23,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 15:10:23,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 15:10:23,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 15:10:23,984 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 15:10:23,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:23" (1/1) ... [2021-12-17 15:10:24,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:23" (1/1) ... [2021-12-17 15:10:24,040 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2021-12-17 15:10:24,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 15:10:24,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 15:10:24,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 15:10:24,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 15:10:24,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:23" (1/1) ... [2021-12-17 15:10:24,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:23" (1/1) ... [2021-12-17 15:10:24,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:23" (1/1) ... [2021-12-17 15:10:24,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:23" (1/1) ... [2021-12-17 15:10:24,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:23" (1/1) ... [2021-12-17 15:10:24,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:23" (1/1) ... [2021-12-17 15:10:24,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:23" (1/1) ... [2021-12-17 15:10:24,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 15:10:24,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 15:10:24,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 15:10:24,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 15:10:24,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:23" (1/1) ... [2021-12-17 15:10:24,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:10:24,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:10:24,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 15:10:24,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 15:10:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2021-12-17 15:10:24,140 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2021-12-17 15:10:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 15:10:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 15:10:24,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 15:10:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 15:10:24,178 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 15:10:24,179 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 15:10:24,295 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 15:10:24,299 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 15:10:24,299 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 15:10:24,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:10:24 BoogieIcfgContainer [2021-12-17 15:10:24,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 15:10:24,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 15:10:24,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 15:10:24,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 15:10:24,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 03:10:23" (1/3) ... [2021-12-17 15:10:24,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f77528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:10:24, skipping insertion in model container [2021-12-17 15:10:24,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:10:23" (2/3) ... [2021-12-17 15:10:24,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f77528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:10:24, skipping insertion in model container [2021-12-17 15:10:24,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:10:24" (3/3) ... [2021-12-17 15:10:24,306 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2021-12-17 15:10:24,310 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 15:10:24,310 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 15:10:24,339 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 15:10:24,344 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 15:10:24,344 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 15:10:24,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 15:10:24,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-17 15:10:24,358 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:24,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:24,359 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:24,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:24,368 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2021-12-17 15:10:24,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:24,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799759637] [2021-12-17 15:10:24,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:24,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:24,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:10:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:10:24,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:24,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799759637] [2021-12-17 15:10:24,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799759637] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:10:24,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:10:24,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:10:24,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031649087] [2021-12-17 15:10:24,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:10:24,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:10:24,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:24,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:10:24,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:10:24,625 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 15:10:24,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:24,703 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-12-17 15:10:24,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:10:24,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-12-17 15:10:24,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:24,710 INFO L225 Difference]: With dead ends: 31 [2021-12-17 15:10:24,710 INFO L226 Difference]: Without dead ends: 18 [2021-12-17 15:10:24,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:10:24,715 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:24,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 41 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:10:24,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-12-17 15:10:24,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-17 15:10:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-17 15:10:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-17 15:10:24,741 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-12-17 15:10:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:24,742 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-17 15:10:24,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 15:10:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-17 15:10:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 15:10:24,743 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:24,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:24,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 15:10:24,744 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:24,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2021-12-17 15:10:24,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:24,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560246788] [2021-12-17 15:10:24,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:24,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:24,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:10:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:10:24,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:24,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560246788] [2021-12-17 15:10:24,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560246788] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:10:24,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:10:24,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:10:24,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610661924] [2021-12-17 15:10:24,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:10:24,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:10:24,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:24,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:10:24,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:10:24,789 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 15:10:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:24,836 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-12-17 15:10:24,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 15:10:24,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-12-17 15:10:24,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:24,838 INFO L225 Difference]: With dead ends: 24 [2021-12-17 15:10:24,838 INFO L226 Difference]: Without dead ends: 20 [2021-12-17 15:10:24,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:10:24,839 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:24,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 33 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 15:10:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-17 15:10:24,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-12-17 15:10:24,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-17 15:10:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-17 15:10:24,844 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-12-17 15:10:24,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:24,845 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-17 15:10:24,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 15:10:24,845 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-17 15:10:24,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 15:10:24,846 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:24,846 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:24,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 15:10:24,846 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:24,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:24,847 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2021-12-17 15:10:24,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:24,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187173911] [2021-12-17 15:10:24,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:24,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:24,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:10:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:24,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:24,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-17 15:10:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 15:10:24,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:24,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187173911] [2021-12-17 15:10:24,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187173911] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:10:24,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509804711] [2021-12-17 15:10:24,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:24,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:24,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:10:24,947 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:10:24,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 15:10:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:25,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 15:10:25,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:10:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 15:10:25,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:10:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 15:10:25,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509804711] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:10:25,460 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:10:25,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2021-12-17 15:10:25,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139463817] [2021-12-17 15:10:25,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:10:25,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 15:10:25,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:25,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 15:10:25,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-12-17 15:10:25,462 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-17 15:10:25,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:25,593 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2021-12-17 15:10:25,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 15:10:25,593 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2021-12-17 15:10:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:25,594 INFO L225 Difference]: With dead ends: 46 [2021-12-17 15:10:25,594 INFO L226 Difference]: Without dead ends: 29 [2021-12-17 15:10:25,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2021-12-17 15:10:25,595 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:25,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 65 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:10:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-17 15:10:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-17 15:10:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2021-12-17 15:10:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2021-12-17 15:10:25,601 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2021-12-17 15:10:25,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:25,601 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2021-12-17 15:10:25,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-17 15:10:25,601 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2021-12-17 15:10:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 15:10:25,602 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:25,603 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:25,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 15:10:25,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:25,819 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:25,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:25,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2021-12-17 15:10:25,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:25,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220717128] [2021-12-17 15:10:25,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:25,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:25,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:10:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:25,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:26,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:26,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:26,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:26,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:26,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:26,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:26,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-17 15:10:26,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:26,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220717128] [2021-12-17 15:10:26,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220717128] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:10:26,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937059277] [2021-12-17 15:10:26,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:26,127 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:26,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:10:26,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:10:26,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 15:10:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:26,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 15:10:26,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:10:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-12-17 15:10:26,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:10:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-12-17 15:10:26,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937059277] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:10:26,691 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:10:26,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2021-12-17 15:10:26,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221080066] [2021-12-17 15:10:26,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:10:26,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-17 15:10:26,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:26,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-17 15:10:26,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-12-17 15:10:26,693 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2021-12-17 15:10:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:26,893 INFO L93 Difference]: Finished difference Result 73 states and 123 transitions. [2021-12-17 15:10:26,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 15:10:26,894 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 65 [2021-12-17 15:10:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:26,895 INFO L225 Difference]: With dead ends: 73 [2021-12-17 15:10:26,896 INFO L226 Difference]: Without dead ends: 44 [2021-12-17 15:10:26,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2021-12-17 15:10:26,897 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:26,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 94 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 15:10:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-17 15:10:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-12-17 15:10:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (24), 9 states have call predecessors, (24), 7 states have call successors, (24) [2021-12-17 15:10:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2021-12-17 15:10:26,919 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 65 [2021-12-17 15:10:26,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:26,920 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2021-12-17 15:10:26,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2021-12-17 15:10:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2021-12-17 15:10:26,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-12-17 15:10:26,923 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:26,923 INFO L514 BasicCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:26,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 15:10:27,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-17 15:10:27,124 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:27,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:27,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1389805118, now seen corresponding path program 2 times [2021-12-17 15:10:27,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:27,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889764780] [2021-12-17 15:10:27,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:27,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:10:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-17 15:10:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-17 15:10:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-17 15:10:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-17 15:10:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2021-12-17 15:10:27,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:27,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889764780] [2021-12-17 15:10:27,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889764780] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:10:27,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654722890] [2021-12-17 15:10:27,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 15:10:27,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:27,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:10:27,465 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:10:27,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 15:10:27,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 15:10:27,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 15:10:27,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 15:10:27,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:10:27,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2021-12-17 15:10:27,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:10:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2021-12-17 15:10:28,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654722890] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:10:28,771 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:10:28,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2021-12-17 15:10:28,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87027225] [2021-12-17 15:10:28,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:10:28,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-17 15:10:28,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:28,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-17 15:10:28,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2021-12-17 15:10:28,772 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2021-12-17 15:10:29,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:29,215 INFO L93 Difference]: Finished difference Result 119 states and 223 transitions. [2021-12-17 15:10:29,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-17 15:10:29,216 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 171 [2021-12-17 15:10:29,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:29,218 INFO L225 Difference]: With dead ends: 119 [2021-12-17 15:10:29,218 INFO L226 Difference]: Without dead ends: 76 [2021-12-17 15:10:29,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2021-12-17 15:10:29,220 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 148 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:29,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 109 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:10:29,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-17 15:10:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2021-12-17 15:10:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (37), 13 states have call predecessors, (37), 12 states have call successors, (37) [2021-12-17 15:10:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 105 transitions. [2021-12-17 15:10:29,228 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 105 transitions. Word has length 171 [2021-12-17 15:10:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:29,228 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 105 transitions. [2021-12-17 15:10:29,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2021-12-17 15:10:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 105 transitions. [2021-12-17 15:10:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2021-12-17 15:10:29,231 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:29,231 INFO L514 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:29,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 15:10:29,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:29,447 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:29,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:29,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1020156483, now seen corresponding path program 3 times [2021-12-17 15:10:29,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:29,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927430837] [2021-12-17 15:10:29,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:29,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:10:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 15:10:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 15:10:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-17 15:10:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 15:10:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-17 15:10:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 15:10:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 15:10:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:29,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-17 15:10:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 15:10:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2021-12-17 15:10:30,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:30,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927430837] [2021-12-17 15:10:30,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927430837] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:10:30,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291345821] [2021-12-17 15:10:30,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 15:10:30,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:30,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:10:30,033 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:10:30,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 15:10:30,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2021-12-17 15:10:30,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 15:10:30,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 15:10:30,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:10:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2021-12-17 15:10:30,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:10:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1548 refuted. 0 times theorem prover too weak. 5358 trivial. 0 not checked. [2021-12-17 15:10:32,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291345821] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:10:32,257 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:10:32,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2021-12-17 15:10:32,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278127887] [2021-12-17 15:10:32,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:10:32,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-17 15:10:32,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:32,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-17 15:10:32,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2021-12-17 15:10:32,262 INFO L87 Difference]: Start difference. First operand 66 states and 105 transitions. Second operand has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2021-12-17 15:10:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:32,641 INFO L93 Difference]: Finished difference Result 172 states and 339 transitions. [2021-12-17 15:10:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-17 15:10:32,642 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) Word has length 351 [2021-12-17 15:10:32,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:32,651 INFO L225 Difference]: With dead ends: 172 [2021-12-17 15:10:32,651 INFO L226 Difference]: Without dead ends: 109 [2021-12-17 15:10:32,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 794 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=654, Invalid=1896, Unknown=0, NotChecked=0, Total=2550 [2021-12-17 15:10:32,656 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 187 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:32,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 172 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:10:32,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-17 15:10:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2021-12-17 15:10:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.109375) internal successors, (71), 62 states have internal predecessors, (71), 17 states have call successors, (17), 12 states have call predecessors, (17), 9 states have return successors, (38), 16 states have call predecessors, (38), 17 states have call successors, (38) [2021-12-17 15:10:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2021-12-17 15:10:32,671 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 351 [2021-12-17 15:10:32,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:32,672 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2021-12-17 15:10:32,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2021-12-17 15:10:32,672 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2021-12-17 15:10:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2021-12-17 15:10:32,677 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:32,677 INFO L514 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:32,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 15:10:32,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:32,895 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:32,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:32,895 INFO L85 PathProgramCache]: Analyzing trace with hash -4939658, now seen corresponding path program 4 times [2021-12-17 15:10:32,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:32,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026511043] [2021-12-17 15:10:32,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:32,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:10:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 15:10:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 15:10:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-17 15:10:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 15:10:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-17 15:10:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 15:10:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 15:10:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-17 15:10:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 15:10:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 15:10:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-17 15:10:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 15:10:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-17 15:10:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:10:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-17 15:10:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:10:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:10:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:10:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2021-12-17 15:10:33,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:10:33,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026511043] [2021-12-17 15:10:33,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026511043] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:10:33,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720054926] [2021-12-17 15:10:33,711 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 15:10:33,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:33,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:10:33,728 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:10:33,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 15:10:33,890 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 15:10:33,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 15:10:33,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-17 15:10:33,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:10:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3346 refuted. 0 times theorem prover too weak. 11122 trivial. 0 not checked. [2021-12-17 15:10:34,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:10:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3454 refuted. 0 times theorem prover too weak. 11014 trivial. 0 not checked. [2021-12-17 15:10:38,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720054926] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:10:38,114 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:10:38,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 31] total 45 [2021-12-17 15:10:38,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116030659] [2021-12-17 15:10:38,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:10:38,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-17 15:10:38,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:10:38,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-17 15:10:38,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1527, Unknown=0, NotChecked=0, Total=1980 [2021-12-17 15:10:38,119 INFO L87 Difference]: Start difference. First operand 91 states and 126 transitions. Second operand has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) [2021-12-17 15:10:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:10:38,697 INFO L93 Difference]: Finished difference Result 217 states and 398 transitions. [2021-12-17 15:10:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-17 15:10:38,697 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) Word has length 528 [2021-12-17 15:10:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:10:38,701 INFO L225 Difference]: With dead ends: 217 [2021-12-17 15:10:38,701 INFO L226 Difference]: Without dead ends: 129 [2021-12-17 15:10:38,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1269 GetRequests, 1197 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1241, Invalid=3871, Unknown=0, NotChecked=0, Total=5112 [2021-12-17 15:10:38,703 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 244 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 15:10:38,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 268 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 15:10:38,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-17 15:10:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2021-12-17 15:10:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 75 states have internal predecessors, (81), 21 states have call successors, (21), 17 states have call predecessors, (21), 9 states have return successors, (51), 16 states have call predecessors, (51), 21 states have call successors, (51) [2021-12-17 15:10:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2021-12-17 15:10:38,728 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 528 [2021-12-17 15:10:38,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:10:38,729 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2021-12-17 15:10:38,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) [2021-12-17 15:10:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2021-12-17 15:10:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-12-17 15:10:38,736 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:10:38,736 INFO L514 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:10:38,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-17 15:10:38,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:10:38,970 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:10:38,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:10:38,971 INFO L85 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 5 times [2021-12-17 15:10:38,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:10:38,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478297326] [2021-12-17 15:10:38,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:10:38,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:10:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 15:10:39,032 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 15:10:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 15:10:39,112 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 15:10:39,112 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 15:10:39,112 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 15:10:39,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 15:10:39,116 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2021-12-17 15:10:39,120 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 15:10:39,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 03:10:39 BoogieIcfgContainer [2021-12-17 15:10:39,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 15:10:39,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 15:10:39,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 15:10:39,215 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 15:10:39,215 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:10:24" (3/4) ... [2021-12-17 15:10:39,216 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 15:10:39,289 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 15:10:39,289 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 15:10:39,289 INFO L158 Benchmark]: Toolchain (without parser) took 15543.80ms. Allocated memory was 71.3MB in the beginning and 237.0MB in the end (delta: 165.7MB). Free memory was 36.4MB in the beginning and 147.3MB in the end (delta: -110.8MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2021-12-17 15:10:39,289 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 71.3MB. Free memory is still 52.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 15:10:39,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.26ms. Allocated memory was 71.3MB in the beginning and 102.8MB in the end (delta: 31.5MB). Free memory was 36.3MB in the beginning and 79.7MB in the end (delta: -43.4MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2021-12-17 15:10:39,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.73ms. Allocated memory is still 102.8MB. Free memory was 79.7MB in the beginning and 78.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:10:39,290 INFO L158 Benchmark]: Boogie Preprocessor took 10.59ms. Allocated memory is still 102.8MB. Free memory was 78.1MB in the beginning and 77.3MB in the end (delta: 840.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 15:10:39,290 INFO L158 Benchmark]: RCFGBuilder took 234.46ms. Allocated memory is still 102.8MB. Free memory was 77.3MB in the beginning and 68.4MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 15:10:39,291 INFO L158 Benchmark]: TraceAbstraction took 14912.60ms. Allocated memory was 102.8MB in the beginning and 237.0MB in the end (delta: 134.2MB). Free memory was 68.1MB in the beginning and 157.8MB in the end (delta: -89.7MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2021-12-17 15:10:39,291 INFO L158 Benchmark]: Witness Printer took 74.30ms. Allocated memory is still 237.0MB. Free memory was 157.8MB in the beginning and 147.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 15:10:39,292 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.29ms. Allocated memory is still 71.3MB. Free memory is still 52.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.26ms. Allocated memory was 71.3MB in the beginning and 102.8MB in the end (delta: 31.5MB). Free memory was 36.3MB in the beginning and 79.7MB in the end (delta: -43.4MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.73ms. Allocated memory is still 102.8MB. Free memory was 79.7MB in the beginning and 78.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 10.59ms. Allocated memory is still 102.8MB. Free memory was 78.1MB in the beginning and 77.3MB in the end (delta: 840.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 234.46ms. Allocated memory is still 102.8MB. Free memory was 77.3MB in the beginning and 68.4MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14912.60ms. Allocated memory was 102.8MB in the beginning and 237.0MB in the end (delta: 134.2MB). Free memory was 68.1MB in the beginning and 157.8MB in the end (delta: -89.7MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * Witness Printer took 74.30ms. Allocated memory is still 237.0MB. Free memory was 157.8MB in the beginning and 147.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L33] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 8, TraceHistogramMax: 77, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 699 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 782 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 641 mSDsCounter, 1156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1794 IncrementalHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1156 mSolverCounterUnsat, 141 mSDtfsCounter, 1794 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2787 GetRequests, 2573 SyntacticMatches, 5 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2730 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=7, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 2757 NumberOfCodeBlocks, 2580 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3418 ConstructedInterpolants, 0 QuantifiedInterpolants, 5454 SizeOfPredicates, 31 NumberOfNonLiveVariables, 2170 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 60175/75984 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-17 15:10:39,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE