./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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/Fibonacci04.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 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 12:36:56,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 12:36:56,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 12:36:56,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 12:36:56,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 12:36:56,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 12:36:56,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 12:36:56,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 12:36:56,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 12:36:56,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 12:36:56,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 12:36:56,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 12:36:56,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 12:36:56,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 12:36:56,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 12:36:56,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 12:36:56,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 12:36:56,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 12:36:56,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 12:36:56,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 12:36:56,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 12:36:56,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 12:36:56,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 12:36:56,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 12:36:56,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 12:36:56,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 12:36:56,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 12:36:56,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 12:36:56,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 12:36:56,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 12:36:56,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 12:36:56,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 12:36:56,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 12:36:56,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 12:36:56,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 12:36:56,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 12:36:56,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 12:36:56,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 12:36:56,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 12:36:56,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 12:36:56,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 12:36:56,229 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 12:36:56,254 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 12:36:56,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 12:36:56,254 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 12:36:56,255 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 12:36:56,255 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 12:36:56,255 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 12:36:56,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 12:36:56,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 12:36:56,257 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 12:36:56,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 12:36:56,257 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 12:36:56,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 12:36:56,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 12:36:56,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 12:36:56,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 12:36:56,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 12:36:56,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 12:36:56,258 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 12:36:56,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 12:36:56,258 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 12:36:56,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 12:36:56,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 12:36:56,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 12:36:56,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 12:36:56,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 12:36:56,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 12:36:56,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 12:36:56,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 12:36:56,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 12:36:56,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 12:36:56,259 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 12:36:56,259 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 12:36:56,260 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 12:36:56,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 12:36:56,260 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 12:36:56,260 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 [2023-02-15 12:36:56,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 12:36:56,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 12:36:56,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 12:36:56,482 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 12:36:56,483 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 12:36:56,484 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci04.c [2023-02-15 12:36:57,424 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 12:36:57,545 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 12:36:57,546 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c [2023-02-15 12:36:57,550 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ee2c134a/5d1d815f1cb149b99b33f9771421c1f3/FLAGd3cd2b172 [2023-02-15 12:36:57,559 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ee2c134a/5d1d815f1cb149b99b33f9771421c1f3 [2023-02-15 12:36:57,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 12:36:57,562 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 12:36:57,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 12:36:57,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 12:36:57,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 12:36:57,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:36:57" (1/1) ... [2023-02-15 12:36:57,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ecad8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:36:57, skipping insertion in model container [2023-02-15 12:36:57,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:36:57" (1/1) ... [2023-02-15 12:36:57,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 12:36:57,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 12:36:57,670 WARN L237 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/Fibonacci04.c[780,793] [2023-02-15 12:36:57,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 12:36:57,679 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 12:36:57,688 WARN L237 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/Fibonacci04.c[780,793] [2023-02-15 12:36:57,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 12:36:57,696 INFO L208 MainTranslator]: Completed translation [2023-02-15 12:36:57,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:36:57 WrapperNode [2023-02-15 12:36:57,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 12:36:57,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 12:36:57,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 12:36:57,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 12:36:57,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:36:57" (1/1) ... [2023-02-15 12:36:57,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:36:57" (1/1) ... [2023-02-15 12:36:57,717 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2023-02-15 12:36:57,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 12:36:57,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 12:36:57,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 12:36:57,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 12:36:57,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:36:57" (1/1) ... [2023-02-15 12:36:57,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:36:57" (1/1) ... [2023-02-15 12:36:57,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:36:57" (1/1) ... [2023-02-15 12:36:57,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:36:57" (1/1) ... [2023-02-15 12:36:57,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:36:57" (1/1) ... [2023-02-15 12:36:57,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:36:57" (1/1) ... [2023-02-15 12:36:57,728 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:36:57" (1/1) ... [2023-02-15 12:36:57,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:36:57" (1/1) ... [2023-02-15 12:36:57,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 12:36:57,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 12:36:57,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 12:36:57,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 12:36:57,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:36:57" (1/1) ... [2023-02-15 12:36:57,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 12:36:57,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:36:57,770 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) [2023-02-15 12:36:57,778 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 [2023-02-15 12:36:57,799 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-02-15 12:36:57,800 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-02-15 12:36:57,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 12:36:57,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 12:36:57,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 12:36:57,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 12:36:57,843 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 12:36:57,845 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 12:36:57,956 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 12:36:57,961 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 12:36:57,961 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-15 12:36:57,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:36:57 BoogieIcfgContainer [2023-02-15 12:36:57,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 12:36:57,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 12:36:57,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 12:36:57,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 12:36:57,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:36:57" (1/3) ... [2023-02-15 12:36:57,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc18ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:36:57, skipping insertion in model container [2023-02-15 12:36:57,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:36:57" (2/3) ... [2023-02-15 12:36:57,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc18ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:36:57, skipping insertion in model container [2023-02-15 12:36:57,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:36:57" (3/3) ... [2023-02-15 12:36:57,972 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2023-02-15 12:36:57,987 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 12:36:57,987 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 12:36:58,038 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 12:36:58,044 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@273803eb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 12:36:58,044 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 12:36:58,047 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) [2023-02-15 12:36:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 12:36:58,052 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:36:58,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:36:58,053 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:36:58,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:36:58,057 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2023-02-15 12:36:58,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:36:58,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628214823] [2023-02-15 12:36:58,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:36:58,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:36:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:58,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:36:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:36:58,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:36:58,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628214823] [2023-02-15 12:36:58,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628214823] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:36:58,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:36:58,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 12:36:58,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898278897] [2023-02-15 12:36:58,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:36:58,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:36:58,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:36:58,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:36:58,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:36:58,300 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) [2023-02-15 12:36:58,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:36:58,387 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-02-15 12:36:58,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 12:36:58,389 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 [2023-02-15 12:36:58,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:36:58,394 INFO L225 Difference]: With dead ends: 31 [2023-02-15 12:36:58,394 INFO L226 Difference]: Without dead ends: 18 [2023-02-15 12:36:58,396 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 [2023-02-15 12:36:58,398 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 [2023-02-15 12:36:58,399 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] [2023-02-15 12:36:58,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-15 12:36:58,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-15 12:36:58,438 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) [2023-02-15 12:36:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-02-15 12:36:58,440 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-02-15 12:36:58,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:36:58,441 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-02-15 12:36:58,442 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) [2023-02-15 12:36:58,442 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-02-15 12:36:58,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 12:36:58,443 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:36:58,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:36:58,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 12:36:58,444 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:36:58,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:36:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2023-02-15 12:36:58,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:36:58,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542222208] [2023-02-15 12:36:58,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:36:58,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:36:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:58,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:36:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:36:58,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:36:58,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542222208] [2023-02-15 12:36:58,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542222208] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:36:58,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:36:58,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 12:36:58,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876921755] [2023-02-15 12:36:58,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:36:58,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:36:58,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:36:58,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:36:58,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:36:58,605 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) [2023-02-15 12:36:58,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:36:58,635 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2023-02-15 12:36:58,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 12:36:58,636 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 [2023-02-15 12:36:58,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:36:58,636 INFO L225 Difference]: With dead ends: 24 [2023-02-15 12:36:58,636 INFO L226 Difference]: Without dead ends: 20 [2023-02-15 12:36:58,637 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 [2023-02-15 12:36:58,638 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 [2023-02-15 12:36:58,638 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] [2023-02-15 12:36:58,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-15 12:36:58,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2023-02-15 12:36:58,642 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) [2023-02-15 12:36:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-02-15 12:36:58,642 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2023-02-15 12:36:58,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:36:58,643 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-02-15 12:36:58,643 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) [2023-02-15 12:36:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-02-15 12:36:58,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 12:36:58,644 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:36:58,644 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:36:58,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 12:36:58,644 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:36:58,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:36:58,645 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2023-02-15 12:36:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:36:58,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945792267] [2023-02-15 12:36:58,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:36:58,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:36:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:58,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:36:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:58,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:36:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:58,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 12:36:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 12:36:58,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:36:58,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945792267] [2023-02-15 12:36:58,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945792267] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:36:58,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30552163] [2023-02-15 12:36:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:36:58,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:36:58,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:36:58,761 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) [2023-02-15 12:36:58,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 12:36:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:58,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 12:36:58,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:36:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 12:36:58,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:36:59,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 12:36:59,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30552163] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:36:59,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:36:59,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2023-02-15 12:36:59,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255872698] [2023-02-15 12:36:59,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:36:59,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 12:36:59,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:36:59,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 12:36:59,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-02-15 12:36:59,059 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) [2023-02-15 12:36:59,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:36:59,214 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2023-02-15 12:36:59,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 12:36:59,215 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 [2023-02-15 12:36:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:36:59,218 INFO L225 Difference]: With dead ends: 46 [2023-02-15 12:36:59,218 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 12:36:59,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-02-15 12:36:59,223 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:36:59,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 63 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:36:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 12:36:59,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-15 12:36:59,236 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) [2023-02-15 12:36:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2023-02-15 12:36:59,238 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2023-02-15 12:36:59,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:36:59,238 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2023-02-15 12:36:59,239 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) [2023-02-15 12:36:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2023-02-15 12:36:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 12:36:59,243 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:36:59,244 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:36:59,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 12:36:59,448 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 [2023-02-15 12:36:59,450 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:36:59,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:36:59,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2023-02-15 12:36:59,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:36:59,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887191617] [2023-02-15 12:36:59,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:36:59,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:36:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:59,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:36:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:36:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:59,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:36:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:59,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:36:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:59,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:36:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:59,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:36:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:59,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:36:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:59,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:36:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:59,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:36:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-02-15 12:36:59,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:36:59,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887191617] [2023-02-15 12:36:59,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887191617] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:36:59,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577362918] [2023-02-15 12:36:59,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:36:59,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:36:59,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:36:59,834 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) [2023-02-15 12:36:59,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 12:36:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:36:59,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 12:36:59,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:36:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-02-15 12:36:59,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:37:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-15 12:37:00,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577362918] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:37:00,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:37:00,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2023-02-15 12:37:00,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534219515] [2023-02-15 12:37:00,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:37:00,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 12:37:00,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:37:00,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 12:37:00,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-02-15 12:37:00,222 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) [2023-02-15 12:37:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:37:00,361 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2023-02-15 12:37:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 12:37:00,361 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 [2023-02-15 12:37:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:37:00,363 INFO L225 Difference]: With dead ends: 73 [2023-02-15 12:37:00,363 INFO L226 Difference]: Without dead ends: 44 [2023-02-15 12:37:00,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2023-02-15 12:37:00,364 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:37:00,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 93 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:37:00,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-15 12:37:00,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-15 12:37:00,370 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, (19), 9 states have call predecessors, (19), 7 states have call successors, (19) [2023-02-15 12:37:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2023-02-15 12:37:00,371 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 65 [2023-02-15 12:37:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:37:00,371 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2023-02-15 12:37:00,371 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) [2023-02-15 12:37:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2023-02-15 12:37:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-02-15 12:37:00,373 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:37:00,374 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 14, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:37:00,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 12:37:00,578 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 [2023-02-15 12:37:00,578 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:37:00,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:37:00,579 INFO L85 PathProgramCache]: Analyzing trace with hash -878098806, now seen corresponding path program 2 times [2023-02-15 12:37:00,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:37:00,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376953719] [2023-02-15 12:37:00,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:37:00,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:37:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:37:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:37:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:37:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 12:37:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:37:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-15 12:37:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:37:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:37:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 12:37:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:37:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-15 12:37:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 100 proven. 219 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2023-02-15 12:37:00,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:37:00,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376953719] [2023-02-15 12:37:00,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376953719] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:37:00,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486721003] [2023-02-15 12:37:00,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 12:37:00,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:37:00,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:37:00,937 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) [2023-02-15 12:37:00,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 12:37:01,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 12:37:01,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 12:37:01,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 12:37:01,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:37:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 79 proven. 263 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2023-02-15 12:37:01,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:37:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 79 proven. 275 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2023-02-15 12:37:01,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486721003] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:37:01,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:37:01,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 17 [2023-02-15 12:37:01,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235173716] [2023-02-15 12:37:01,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:37:01,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 12:37:01,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:37:01,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 12:37:01,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-02-15 12:37:01,584 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-15 12:37:01,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:37:01,736 INFO L93 Difference]: Finished difference Result 101 states and 150 transitions. [2023-02-15 12:37:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 12:37:01,737 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) Word has length 144 [2023-02-15 12:37:01,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:37:01,738 INFO L225 Difference]: With dead ends: 101 [2023-02-15 12:37:01,738 INFO L226 Difference]: Without dead ends: 60 [2023-02-15 12:37:01,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 319 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2023-02-15 12:37:01,739 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:37:01,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 94 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:37:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-15 12:37:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2023-02-15 12:37:01,744 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, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2023-02-15 12:37:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2023-02-15 12:37:01,745 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 144 [2023-02-15 12:37:01,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:37:01,745 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2023-02-15 12:37:01,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-15 12:37:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2023-02-15 12:37:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-02-15 12:37:01,747 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:37:01,747 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:37:01,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 12:37:01,952 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 [2023-02-15 12:37:01,952 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:37:01,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:37:01,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1511331526, now seen corresponding path program 3 times [2023-02-15 12:37:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:37:01,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901949528] [2023-02-15 12:37:01,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:37:01,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:37:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:37:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:37:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:37:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:37:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:37:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:37:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:37:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:37:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:37:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:37:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:37:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:37:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:37:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 320 proven. 96 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2023-02-15 12:37:02,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:37:02,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901949528] [2023-02-15 12:37:02,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901949528] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:37:02,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027682793] [2023-02-15 12:37:02,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 12:37:02,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:37:02,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:37:02,285 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) [2023-02-15 12:37:02,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 12:37:02,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-02-15 12:37:02,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 12:37:02,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 12:37:02,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:37:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 340 proven. 33 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2023-02-15 12:37:02,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:37:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 340 proven. 34 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2023-02-15 12:37:02,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027682793] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:37:02,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:37:02,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 18 [2023-02-15 12:37:02,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098693172] [2023-02-15 12:37:02,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:37:02,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 12:37:02,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:37:02,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 12:37:02,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2023-02-15 12:37:02,793 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) [2023-02-15 12:37:02,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:37:02,916 INFO L93 Difference]: Finished difference Result 101 states and 160 transitions. [2023-02-15 12:37:02,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 12:37:02,916 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) Word has length 147 [2023-02-15 12:37:02,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:37:02,917 INFO L225 Difference]: With dead ends: 101 [2023-02-15 12:37:02,917 INFO L226 Difference]: Without dead ends: 49 [2023-02-15 12:37:02,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 326 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2023-02-15 12:37:02,918 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:37:02,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 121 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:37:02,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-15 12:37:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-02-15 12:37:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 33 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-15 12:37:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2023-02-15 12:37:02,923 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 147 [2023-02-15 12:37:02,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:37:02,923 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2023-02-15 12:37:02,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) [2023-02-15 12:37:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2023-02-15 12:37:02,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-02-15 12:37:02,924 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:37:02,924 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:37:02,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 12:37:03,128 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 [2023-02-15 12:37:03,129 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:37:03,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:37:03,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2094125593, now seen corresponding path program 4 times [2023-02-15 12:37:03,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:37:03,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348684951] [2023-02-15 12:37:03,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:37:03,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:37:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 12:37:03,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 12:37:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 12:37:03,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 12:37:03,162 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 12:37:03,163 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 12:37:03,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 12:37:03,167 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-02-15 12:37:03,170 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 12:37:03,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:37:03 BoogieIcfgContainer [2023-02-15 12:37:03,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 12:37:03,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 12:37:03,196 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 12:37:03,196 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 12:37:03,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:36:57" (3/4) ... [2023-02-15 12:37:03,197 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 12:37:03,227 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 12:37:03,228 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 12:37:03,228 INFO L158 Benchmark]: Toolchain (without parser) took 5665.79ms. Allocated memory was 155.2MB in the beginning and 278.9MB in the end (delta: 123.7MB). Free memory was 108.8MB in the beginning and 146.9MB in the end (delta: -38.1MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. [2023-02-15 12:37:03,228 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 12:37:03,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 132.61ms. Allocated memory is still 155.2MB. Free memory was 108.8MB in the beginning and 99.0MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 12:37:03,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.84ms. Allocated memory is still 155.2MB. Free memory was 98.4MB in the beginning and 97.6MB in the end (delta: 819.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 12:37:03,229 INFO L158 Benchmark]: Boogie Preprocessor took 11.23ms. Allocated memory is still 155.2MB. Free memory was 97.6MB in the beginning and 96.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 12:37:03,229 INFO L158 Benchmark]: RCFGBuilder took 234.16ms. Allocated memory is still 155.2MB. Free memory was 96.3MB in the beginning and 86.4MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 12:37:03,229 INFO L158 Benchmark]: TraceAbstraction took 5229.69ms. Allocated memory was 155.2MB in the beginning and 278.9MB in the end (delta: 123.7MB). Free memory was 85.8MB in the beginning and 150.0MB in the end (delta: -64.2MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2023-02-15 12:37:03,230 INFO L158 Benchmark]: Witness Printer took 32.27ms. Allocated memory is still 278.9MB. Free memory was 150.0MB in the beginning and 146.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 12:37:03,231 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.14ms. Allocated memory is still 155.2MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 132.61ms. Allocated memory is still 155.2MB. Free memory was 108.8MB in the beginning and 99.0MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.84ms. Allocated memory is still 155.2MB. Free memory was 98.4MB in the beginning and 97.6MB in the end (delta: 819.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.23ms. Allocated memory is still 155.2MB. Free memory was 97.6MB in the beginning and 96.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 234.16ms. Allocated memory is still 155.2MB. Free memory was 96.3MB in the beginning and 86.4MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5229.69ms. Allocated memory was 155.2MB in the beginning and 278.9MB in the end (delta: 123.7MB). Free memory was 85.8MB in the beginning and 150.0MB in the end (delta: -64.2MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. * Witness Printer took 32.27ms. Allocated memory is still 278.9MB. Free memory was 150.0MB in the beginning and 146.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: 35]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L30] int x = __VERIFIER_nondet_int(); [L31] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L19] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L21] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L21] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L24] return fibonacci(n-1) + fibonacci(n-2); [L31] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L31] int result = fibonacci(x); [L32] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L35] reach_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 443 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 339 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 728 IncrementalHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 104 mSDtfsCounter, 728 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 941 GetRequests, 838 SyntacticMatches, 12 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=6, InterpolantAutomatonStates: 66, 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, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 885 NumberOfCodeBlocks, 828 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1144 ConstructedInterpolants, 0 QuantifiedInterpolants, 1878 SizeOfPredicates, 20 NumberOfNonLiveVariables, 813 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 6248/7404 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! [2023-02-15 12:37:03,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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