./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 6c24879c 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-?-6c24879 [2022-07-12 06:21:45,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 06:21:45,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 06:21:45,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 06:21:45,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 06:21:45,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 06:21:45,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 06:21:45,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 06:21:45,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 06:21:45,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 06:21:45,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 06:21:45,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 06:21:45,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 06:21:45,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 06:21:45,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 06:21:45,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 06:21:45,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 06:21:45,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 06:21:45,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 06:21:45,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 06:21:45,710 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 06:21:45,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 06:21:45,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 06:21:45,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 06:21:45,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 06:21:45,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 06:21:45,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 06:21:45,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 06:21:45,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 06:21:45,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 06:21:45,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 06:21:45,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 06:21:45,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 06:21:45,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 06:21:45,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 06:21:45,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 06:21:45,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 06:21:45,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 06:21:45,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 06:21:45,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 06:21:45,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 06:21:45,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 06:21:45,729 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 06:21:45,765 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 06:21:45,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 06:21:45,766 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 06:21:45,767 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 06:21:45,767 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 06:21:45,767 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 06:21:45,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 06:21:45,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 06:21:45,768 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 06:21:45,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 06:21:45,770 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 06:21:45,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 06:21:45,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 06:21:45,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 06:21:45,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 06:21:45,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 06:21:45,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 06:21:45,771 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 06:21:45,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 06:21:45,771 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 06:21:45,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 06:21:45,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 06:21:45,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 06:21:45,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 06:21:45,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:21:45,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 06:21:45,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 06:21:45,773 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 06:21:45,773 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 06:21:45,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 06:21:45,773 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 06:21:45,774 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 06:21:45,774 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 06:21:45,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 [2022-07-12 06:21:46,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 06:21:46,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 06:21:46,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 06:21:46,084 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 06:21:46,085 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 06:21:46,087 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2022-07-12 06:21:46,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d631951c/9e53f71e5c2d43278b5616d57021b136/FLAG56d155a0d [2022-07-12 06:21:46,573 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 06:21:46,573 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2022-07-12 06:21:46,579 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d631951c/9e53f71e5c2d43278b5616d57021b136/FLAG56d155a0d [2022-07-12 06:21:46,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d631951c/9e53f71e5c2d43278b5616d57021b136 [2022-07-12 06:21:46,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 06:21:46,602 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 06:21:46,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 06:21:46,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 06:21:46,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 06:21:46,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:21:46" (1/1) ... [2022-07-12 06:21:46,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@558a2914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:46, skipping insertion in model container [2022-07-12 06:21:46,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:21:46" (1/1) ... [2022-07-12 06:21:46,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 06:21:46,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 06:21:46,805 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] [2022-07-12 06:21:46,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:21:46,814 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 06:21:46,827 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] [2022-07-12 06:21:46,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:21:46,837 INFO L208 MainTranslator]: Completed translation [2022-07-12 06:21:46,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:46 WrapperNode [2022-07-12 06:21:46,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 06:21:46,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 06:21:46,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 06:21:46,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 06:21:46,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:46" (1/1) ... [2022-07-12 06:21:46,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:46" (1/1) ... [2022-07-12 06:21:46,861 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2022-07-12 06:21:46,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 06:21:46,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 06:21:46,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 06:21:46,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 06:21:46,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:46" (1/1) ... [2022-07-12 06:21:46,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:46" (1/1) ... [2022-07-12 06:21:46,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:46" (1/1) ... [2022-07-12 06:21:46,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:46" (1/1) ... [2022-07-12 06:21:46,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:46" (1/1) ... [2022-07-12 06:21:46,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:46" (1/1) ... [2022-07-12 06:21:46,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:46" (1/1) ... [2022-07-12 06:21:46,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 06:21:46,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 06:21:46,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 06:21:46,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 06:21:46,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:46" (1/1) ... [2022-07-12 06:21:46,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:21:46,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:46,905 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) [2022-07-12 06:21:46,907 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 [2022-07-12 06:21:46,945 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-07-12 06:21:46,946 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-07-12 06:21:46,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 06:21:46,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 06:21:46,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 06:21:46,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 06:21:46,993 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 06:21:46,994 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 06:21:47,137 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 06:21:47,144 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 06:21:47,147 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 06:21:47,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:21:47 BoogieIcfgContainer [2022-07-12 06:21:47,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 06:21:47,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 06:21:47,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 06:21:47,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 06:21:47,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:21:46" (1/3) ... [2022-07-12 06:21:47,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf50b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:21:47, skipping insertion in model container [2022-07-12 06:21:47,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:46" (2/3) ... [2022-07-12 06:21:47,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf50b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:21:47, skipping insertion in model container [2022-07-12 06:21:47,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:21:47" (3/3) ... [2022-07-12 06:21:47,159 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2022-07-12 06:21:47,171 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 06:21:47,171 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 06:21:47,223 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 06:21:47,230 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@701c662c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3535cb89 [2022-07-12 06:21:47,230 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 06:21:47,235 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) [2022-07-12 06:21:47,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 06:21:47,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:47,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:47,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:47,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:47,251 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2022-07-12 06:21:47,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:47,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267510213] [2022-07-12 06:21:47,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:47,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:21:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 06:21:47,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:47,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267510213] [2022-07-12 06:21:47,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267510213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:21:47,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:21:47,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:21:47,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168222870] [2022-07-12 06:21:47,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:21:47,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:21:47,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:47,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:21:47,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:21:47,487 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) [2022-07-12 06:21:47,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:47,550 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-07-12 06:21:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:21:47,556 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 [2022-07-12 06:21:47,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:47,562 INFO L225 Difference]: With dead ends: 31 [2022-07-12 06:21:47,564 INFO L226 Difference]: Without dead ends: 18 [2022-07-12 06:21:47,567 INFO L412 NwaCegarLoop]: 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 [2022-07-12 06:21:47,576 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:47,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 40 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:21:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-12 06:21:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-12 06:21:47,611 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) [2022-07-12 06:21:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-12 06:21:47,615 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-07-12 06:21:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:47,616 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-12 06:21:47,617 INFO L496 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) [2022-07-12 06:21:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-07-12 06:21:47,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 06:21:47,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:47,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:47,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 06:21:47,621 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:47,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:47,622 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2022-07-12 06:21:47,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:47,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966828682] [2022-07-12 06:21:47,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:47,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:21:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 06:21:47,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:47,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966828682] [2022-07-12 06:21:47,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966828682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:21:47,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:21:47,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:21:47,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321088220] [2022-07-12 06:21:47,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:21:47,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:21:47,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:47,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:21:47,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:21:47,707 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) [2022-07-12 06:21:47,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:47,759 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-07-12 06:21:47,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:21:47,761 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 [2022-07-12 06:21:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:47,762 INFO L225 Difference]: With dead ends: 24 [2022-07-12 06:21:47,762 INFO L226 Difference]: Without dead ends: 20 [2022-07-12 06:21:47,764 INFO L412 NwaCegarLoop]: 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 [2022-07-12 06:21:47,765 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:47,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:21:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-12 06:21:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-12 06:21:47,770 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) [2022-07-12 06:21:47,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-12 06:21:47,771 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-07-12 06:21:47,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:47,771 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-12 06:21:47,772 INFO L496 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) [2022-07-12 06:21:47,772 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-07-12 06:21:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 06:21:47,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:47,773 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:47,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 06:21:47,773 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:47,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:47,774 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2022-07-12 06:21:47,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:47,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982402957] [2022-07-12 06:21:47,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:47,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:21:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 06:21:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 06:21:47,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:47,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982402957] [2022-07-12 06:21:47,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982402957] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:47,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456673233] [2022-07-12 06:21:47,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:47,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:47,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:47,912 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) [2022-07-12 06:21:47,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 06:21:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 06:21:47,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 06:21:48,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 06:21:48,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456673233] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:48,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:48,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2022-07-12 06:21:48,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069934301] [2022-07-12 06:21:48,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:48,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 06:21:48,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:48,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 06:21:48,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-07-12 06:21:48,330 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) [2022-07-12 06:21:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:48,521 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-07-12 06:21:48,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 06:21:48,522 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 [2022-07-12 06:21:48,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:48,526 INFO L225 Difference]: With dead ends: 46 [2022-07-12 06:21:48,527 INFO L226 Difference]: Without dead ends: 29 [2022-07-12 06:21:48,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-07-12 06:21:48,536 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:48,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 63 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:21:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-12 06:21:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-12 06:21:48,553 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) [2022-07-12 06:21:48,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-07-12 06:21:48,556 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2022-07-12 06:21:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:48,557 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2022-07-12 06:21:48,558 INFO L496 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) [2022-07-12 06:21:48,558 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2022-07-12 06:21:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 06:21:48,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:48,563 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:48,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 06:21:48,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:48,778 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:48,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:48,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2022-07-12 06:21:48,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:48,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229208229] [2022-07-12 06:21:48,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:48,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:21:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:48,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:49,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:49,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:49,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:49,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:49,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:49,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-12 06:21:49,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:49,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229208229] [2022-07-12 06:21:49,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229208229] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:49,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041619499] [2022-07-12 06:21:49,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:49,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:49,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:49,097 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) [2022-07-12 06:21:49,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 06:21:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:49,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 06:21:49,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-12 06:21:49,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 06:21:49,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041619499] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:49,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:49,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2022-07-12 06:21:49,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073566636] [2022-07-12 06:21:49,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:49,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 06:21:49,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:49,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 06:21:49,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-07-12 06:21:49,602 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) [2022-07-12 06:21:49,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:49,834 INFO L93 Difference]: Finished difference Result 73 states and 123 transitions. [2022-07-12 06:21:49,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 06:21:49,835 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 [2022-07-12 06:21:49,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:49,837 INFO L225 Difference]: With dead ends: 73 [2022-07-12 06:21:49,837 INFO L226 Difference]: Without dead ends: 44 [2022-07-12 06:21:49,838 INFO L412 NwaCegarLoop]: 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 [2022-07-12 06:21:49,839 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:49,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 93 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:21:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-12 06:21:49,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-07-12 06:21:49,848 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) [2022-07-12 06:21:49,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2022-07-12 06:21:49,849 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 65 [2022-07-12 06:21:49,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:49,849 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2022-07-12 06:21:49,850 INFO L496 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) [2022-07-12 06:21:49,850 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2022-07-12 06:21:49,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 06:21:49,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:49,853 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:49,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 06:21:50,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-12 06:21:50,060 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:50,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1389805118, now seen corresponding path program 2 times [2022-07-12 06:21:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:50,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088890421] [2022-07-12 06:21:50,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:50,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:21:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 06:21:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:21:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 06:21:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 06:21:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2022-07-12 06:21:50,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:50,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088890421] [2022-07-12 06:21:50,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088890421] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:50,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462484404] [2022-07-12 06:21:50,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 06:21:50,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:50,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:50,504 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) [2022-07-12 06:21:50,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 06:21:50,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 06:21:50,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:21:50,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 06:21:50,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2022-07-12 06:21:51,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:52,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2022-07-12 06:21:52,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462484404] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:52,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:52,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2022-07-12 06:21:52,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440897662] [2022-07-12 06:21:52,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:52,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 06:21:52,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:52,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 06:21:52,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-07-12 06:21:52,295 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) [2022-07-12 06:21:52,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:52,933 INFO L93 Difference]: Finished difference Result 119 states and 223 transitions. [2022-07-12 06:21:52,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-12 06:21:52,934 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 [2022-07-12 06:21:52,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:52,935 INFO L225 Difference]: With dead ends: 119 [2022-07-12 06:21:52,935 INFO L226 Difference]: Without dead ends: 76 [2022-07-12 06:21:52,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2022-07-12 06:21:52,938 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 148 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:52,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 108 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 06:21:52,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-12 06:21:52,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-07-12 06:21:52,959 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) [2022-07-12 06:21:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 105 transitions. [2022-07-12 06:21:52,963 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 105 transitions. Word has length 171 [2022-07-12 06:21:52,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:52,964 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 105 transitions. [2022-07-12 06:21:52,965 INFO L496 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) [2022-07-12 06:21:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 105 transitions. [2022-07-12 06:21:52,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2022-07-12 06:21:52,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:52,980 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:53,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 06:21:53,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:53,200 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:53,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:53,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1020156483, now seen corresponding path program 3 times [2022-07-12 06:21:53,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:53,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072872643] [2022-07-12 06:21:53,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:53,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:21:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 06:21:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 06:21:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 06:21:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 06:21:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 06:21:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 06:21:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 06:21:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 06:21:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 06:21:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2022-07-12 06:21:54,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:54,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072872643] [2022-07-12 06:21:54,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072872643] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:54,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152701673] [2022-07-12 06:21:54,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 06:21:54,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:54,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:54,681 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) [2022-07-12 06:21:54,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 06:21:54,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2022-07-12 06:21:54,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:21:54,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 06:21:54,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2022-07-12 06:21:54,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1548 refuted. 0 times theorem prover too weak. 5358 trivial. 0 not checked. [2022-07-12 06:21:57,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152701673] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:57,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:57,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2022-07-12 06:21:57,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032702362] [2022-07-12 06:21:57,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:57,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 06:21:57,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:57,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 06:21:57,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 06:21:57,595 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) [2022-07-12 06:21:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:58,298 INFO L93 Difference]: Finished difference Result 172 states and 339 transitions. [2022-07-12 06:21:58,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 06:21:58,299 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 [2022-07-12 06:21:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:58,302 INFO L225 Difference]: With dead ends: 172 [2022-07-12 06:21:58,302 INFO L226 Difference]: Without dead ends: 109 [2022-07-12 06:21:58,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 794 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=654, Invalid=1896, Unknown=0, NotChecked=0, Total=2550 [2022-07-12 06:21:58,311 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 187 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:58,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 171 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 06:21:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-12 06:21:58,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2022-07-12 06:21:58,327 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) [2022-07-12 06:21:58,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2022-07-12 06:21:58,331 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 351 [2022-07-12 06:21:58,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:58,334 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2022-07-12 06:21:58,334 INFO L496 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) [2022-07-12 06:21:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2022-07-12 06:21:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2022-07-12 06:21:58,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:58,346 INFO L195 NwaCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:58,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 06:21:58,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:58,570 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:58,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:58,571 INFO L85 PathProgramCache]: Analyzing trace with hash -4939658, now seen corresponding path program 4 times [2022-07-12 06:21:58,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:58,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649561336] [2022-07-12 06:21:58,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:58,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:21:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 06:21:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 06:21:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 06:21:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 06:21:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 06:21:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 06:21:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 06:21:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-12 06:21:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 06:21:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 06:21:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 06:21:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:21:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 06:21:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:21:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 06:21:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:59,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:22:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:00,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:22:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:00,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:22:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:00,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:22:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:00,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:22:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:00,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 06:22:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:00,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:22:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:00,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:22:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2022-07-12 06:22:00,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:22:00,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649561336] [2022-07-12 06:22:00,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649561336] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:22:00,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306505604] [2022-07-12 06:22:00,041 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 06:22:00,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:22:00,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:22:00,042 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) [2022-07-12 06:22:00,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 06:22:00,219 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 06:22:00,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:22:00,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 06:22:00,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:22:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3346 refuted. 0 times theorem prover too weak. 11122 trivial. 0 not checked. [2022-07-12 06:22:00,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:22:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3454 refuted. 0 times theorem prover too weak. 11014 trivial. 0 not checked. [2022-07-12 06:22:04,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306505604] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:22:04,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:22:04,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 31] total 45 [2022-07-12 06:22:04,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032674545] [2022-07-12 06:22:04,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:22:04,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-12 06:22:04,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:22:04,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-12 06:22:04,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1527, Unknown=0, NotChecked=0, Total=1980 [2022-07-12 06:22:04,235 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) [2022-07-12 06:22:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:22:05,279 INFO L93 Difference]: Finished difference Result 217 states and 398 transitions. [2022-07-12 06:22:05,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-12 06:22:05,279 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 [2022-07-12 06:22:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:22:05,282 INFO L225 Difference]: With dead ends: 217 [2022-07-12 06:22:05,282 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 06:22:05,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1269 GetRequests, 1197 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1241, Invalid=3871, Unknown=0, NotChecked=0, Total=5112 [2022-07-12 06:22:05,285 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 244 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 06:22:05,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 268 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 06:22:05,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 06:22:05,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2022-07-12 06:22:05,301 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) [2022-07-12 06:22:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2022-07-12 06:22:05,302 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 528 [2022-07-12 06:22:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:22:05,303 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2022-07-12 06:22:05,309 INFO L496 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) [2022-07-12 06:22:05,310 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2022-07-12 06:22:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2022-07-12 06:22:05,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:22:05,333 INFO L195 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:22:05,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 06:22:05,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:22:05,534 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:22:05,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:22:05,534 INFO L85 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 5 times [2022-07-12 06:22:05,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:22:05,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733054787] [2022-07-12 06:22:05,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:22:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:22:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:22:05,632 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 06:22:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:22:05,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 06:22:05,809 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 06:22:05,809 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 06:22:05,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 06:22:05,814 INFO L356 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2022-07-12 06:22:05,819 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 06:22:05,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:22:05 BoogieIcfgContainer [2022-07-12 06:22:05,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 06:22:05,964 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 06:22:05,964 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 06:22:05,964 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 06:22:05,965 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:21:47" (3/4) ... [2022-07-12 06:22:05,966 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 06:22:06,079 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 06:22:06,079 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 06:22:06,080 INFO L158 Benchmark]: Toolchain (without parser) took 19478.30ms. Allocated memory was 100.7MB in the beginning and 234.9MB in the end (delta: 134.2MB). Free memory was 66.7MB in the beginning and 105.5MB in the end (delta: -38.7MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. [2022-07-12 06:22:06,080 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 77.6MB. Free memory was 50.5MB in the beginning and 50.5MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:22:06,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.63ms. Allocated memory is still 100.7MB. Free memory was 66.6MB in the beginning and 77.9MB in the end (delta: -11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 06:22:06,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.27ms. Allocated memory is still 100.7MB. Free memory was 77.9MB in the beginning and 76.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:22:06,080 INFO L158 Benchmark]: Boogie Preprocessor took 10.00ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 75.9MB in the end (delta: 553.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:22:06,084 INFO L158 Benchmark]: RCFGBuilder took 276.51ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 66.4MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 06:22:06,085 INFO L158 Benchmark]: TraceAbstraction took 18811.20ms. Allocated memory was 100.7MB in the beginning and 234.9MB in the end (delta: 134.2MB). Free memory was 65.9MB in the beginning and 116.0MB in the end (delta: -50.1MB). Peak memory consumption was 85.3MB. Max. memory is 16.1GB. [2022-07-12 06:22:06,085 INFO L158 Benchmark]: Witness Printer took 115.65ms. Allocated memory is still 234.9MB. Free memory was 116.0MB in the beginning and 105.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 06:22:06,087 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.25ms. Allocated memory is still 77.6MB. Free memory was 50.5MB in the beginning and 50.5MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.63ms. Allocated memory is still 100.7MB. Free memory was 66.6MB in the beginning and 77.9MB in the end (delta: -11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.27ms. Allocated memory is still 100.7MB. Free memory was 77.9MB in the beginning and 76.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 10.00ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 75.9MB in the end (delta: 553.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 276.51ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 66.4MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18811.20ms. Allocated memory was 100.7MB in the beginning and 234.9MB in the end (delta: 134.2MB). Free memory was 65.9MB in the beginning and 116.0MB in the end (delta: -50.1MB). Peak memory consumption was 85.3MB. Max. memory is 16.1GB. * Witness Printer took 115.65ms. Allocated memory is still 234.9MB. Free memory was 116.0MB in the beginning and 105.5MB 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: 18.6s, OverallIterations: 8, TraceHistogramMax: 77, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 699 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 775 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 634 mSDsCounter, 1138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1821 IncrementalHoareTripleChecker+Invalid, 2959 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1138 mSolverCounterUnsat, 141 mSDtfsCounter, 1821 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, 2.3s 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.8s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 2757 NumberOfCodeBlocks, 2580 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3418 ConstructedInterpolants, 0 QuantifiedInterpolants, 5479 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! [2022-07-12 06:22:06,148 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