./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 574ddb4e 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-?-574ddb4 [2023-02-17 07:59:01,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 07:59:01,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 07:59:01,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 07:59:01,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 07:59:01,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 07:59:01,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 07:59:01,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 07:59:01,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 07:59:01,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 07:59:01,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 07:59:01,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 07:59:01,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 07:59:01,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 07:59:01,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 07:59:01,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 07:59:01,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 07:59:01,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 07:59:01,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 07:59:01,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 07:59:01,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 07:59:01,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 07:59:01,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 07:59:01,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 07:59:01,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 07:59:01,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 07:59:01,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 07:59:01,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 07:59:01,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 07:59:01,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 07:59:01,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 07:59:01,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 07:59:01,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 07:59:01,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 07:59:01,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 07:59:01,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 07:59:01,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 07:59:01,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 07:59:01,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 07:59:01,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 07:59:01,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 07:59:01,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 07:59:01,134 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 07:59:01,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 07:59:01,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 07:59:01,135 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 07:59:01,136 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 07:59:01,136 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 07:59:01,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 07:59:01,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 07:59:01,137 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 07:59:01,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 07:59:01,137 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 07:59:01,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 07:59:01,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 07:59:01,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 07:59:01,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 07:59:01,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 07:59:01,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 07:59:01,138 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 07:59:01,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 07:59:01,139 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 07:59:01,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 07:59:01,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 07:59:01,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 07:59:01,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 07:59:01,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 07:59:01,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 07:59:01,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 07:59:01,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 07:59:01,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 07:59:01,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 07:59:01,140 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 07:59:01,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 07:59:01,141 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 07:59:01,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 07:59:01,141 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 07:59:01,141 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-17 07:59:01,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 07:59:01,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 07:59:01,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 07:59:01,317 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 07:59:01,318 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 07:59:01,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci04.c [2023-02-17 07:59:02,286 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 07:59:02,420 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 07:59:02,421 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c [2023-02-17 07:59:02,424 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a7358bc/9a5e95b4ae0d43c4a96ae70e55befbbe/FLAGeaf9755b7 [2023-02-17 07:59:02,433 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78a7358bc/9a5e95b4ae0d43c4a96ae70e55befbbe [2023-02-17 07:59:02,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 07:59:02,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 07:59:02,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 07:59:02,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 07:59:02,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 07:59:02,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 07:59:02" (1/1) ... [2023-02-17 07:59:02,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3307facc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:02, skipping insertion in model container [2023-02-17 07:59:02,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 07:59:02" (1/1) ... [2023-02-17 07:59:02,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 07:59:02,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 07:59:02,568 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-17 07:59:02,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 07:59:02,581 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 07:59:02,592 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-17 07:59:02,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 07:59:02,601 INFO L208 MainTranslator]: Completed translation [2023-02-17 07:59:02,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:02 WrapperNode [2023-02-17 07:59:02,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 07:59:02,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 07:59:02,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 07:59:02,602 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 07:59:02,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:02" (1/1) ... [2023-02-17 07:59:02,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:02" (1/1) ... [2023-02-17 07:59:02,620 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2023-02-17 07:59:02,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 07:59:02,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 07:59:02,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 07:59:02,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 07:59:02,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:02" (1/1) ... [2023-02-17 07:59:02,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:02" (1/1) ... [2023-02-17 07:59:02,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:02" (1/1) ... [2023-02-17 07:59:02,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:02" (1/1) ... [2023-02-17 07:59:02,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:02" (1/1) ... [2023-02-17 07:59:02,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:02" (1/1) ... [2023-02-17 07:59:02,630 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:02" (1/1) ... [2023-02-17 07:59:02,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:02" (1/1) ... [2023-02-17 07:59:02,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 07:59:02,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 07:59:02,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 07:59:02,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 07:59:02,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:02" (1/1) ... [2023-02-17 07:59:02,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 07:59:02,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:59:02,665 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-17 07:59:02,667 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-17 07:59:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-02-17 07:59:02,692 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-02-17 07:59:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 07:59:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 07:59:02,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 07:59:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 07:59:02,730 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 07:59:02,732 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 07:59:02,809 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 07:59:02,818 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 07:59:02,818 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 07:59:02,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:59:02 BoogieIcfgContainer [2023-02-17 07:59:02,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 07:59:02,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 07:59:02,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 07:59:02,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 07:59:02,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 07:59:02" (1/3) ... [2023-02-17 07:59:02,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c521e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 07:59:02, skipping insertion in model container [2023-02-17 07:59:02,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:02" (2/3) ... [2023-02-17 07:59:02,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c521e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 07:59:02, skipping insertion in model container [2023-02-17 07:59:02,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:59:02" (3/3) ... [2023-02-17 07:59:02,830 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2023-02-17 07:59:02,841 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 07:59:02,841 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 07:59:02,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 07:59:02,884 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;@753a6d31, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 07:59:02,884 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 07:59:02,887 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-17 07:59:02,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 07:59:02,891 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:02,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:59:02,892 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:02,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:02,895 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2023-02-17 07:59:02,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:02,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442567209] [2023-02-17 07:59:02,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:02,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:03,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 07:59:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:03,094 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-17 07:59:03,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:03,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442567209] [2023-02-17 07:59:03,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442567209] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:59:03,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:59:03,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 07:59:03,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504186824] [2023-02-17 07:59:03,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:59:03,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 07:59:03,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:03,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 07:59:03,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 07:59:03,128 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-17 07:59:03,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:03,202 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-02-17 07:59:03,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 07:59:03,204 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-17 07:59:03,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:03,209 INFO L225 Difference]: With dead ends: 31 [2023-02-17 07:59:03,209 INFO L226 Difference]: Without dead ends: 18 [2023-02-17 07:59:03,211 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-17 07:59:03,213 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.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:59:03,213 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.1s Time] [2023-02-17 07:59:03,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-17 07:59:03,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-17 07:59:03,235 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-17 07:59:03,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-02-17 07:59:03,236 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-02-17 07:59:03,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:03,237 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-02-17 07:59:03,237 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-17 07:59:03,237 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-02-17 07:59:03,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 07:59:03,238 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:03,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:59:03,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 07:59:03,239 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:03,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:03,239 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2023-02-17 07:59:03,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:03,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727605103] [2023-02-17 07:59:03,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:03,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:03,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 07:59:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:03,301 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-17 07:59:03,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:03,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727605103] [2023-02-17 07:59:03,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727605103] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:59:03,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:59:03,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 07:59:03,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480515046] [2023-02-17 07:59:03,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:59:03,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 07:59:03,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:03,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 07:59:03,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 07:59:03,305 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-17 07:59:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:03,337 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2023-02-17 07:59:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 07:59:03,337 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-17 07:59:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:03,338 INFO L225 Difference]: With dead ends: 24 [2023-02-17 07:59:03,338 INFO L226 Difference]: Without dead ends: 20 [2023-02-17 07:59:03,339 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-17 07:59:03,340 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-17 07:59:03,340 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-17 07:59:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-17 07:59:03,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2023-02-17 07:59:03,344 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-17 07:59:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-02-17 07:59:03,344 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2023-02-17 07:59:03,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:03,345 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-02-17 07:59:03,345 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-17 07:59:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-02-17 07:59:03,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 07:59:03,346 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:03,346 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-17 07:59:03,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 07:59:03,346 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:03,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:03,347 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2023-02-17 07:59:03,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:03,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443728640] [2023-02-17 07:59:03,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:03,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 07:59:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:03,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:03,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 07:59:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:03,470 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-17 07:59:03,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:03,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443728640] [2023-02-17 07:59:03,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443728640] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:59:03,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191807273] [2023-02-17 07:59:03,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:03,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:03,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:59:03,493 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-17 07:59:03,494 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-17 07:59:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:03,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 07:59:03,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:59:03,614 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-17 07:59:03,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:59:03,728 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-17 07:59:03,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191807273] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:59:03,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:59:03,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2023-02-17 07:59:03,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146498633] [2023-02-17 07:59:03,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:59:03,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 07:59:03,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:03,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 07:59:03,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-02-17 07:59:03,733 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-17 07:59:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:03,897 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2023-02-17 07:59:03,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 07:59:03,897 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-17 07:59:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:03,901 INFO L225 Difference]: With dead ends: 46 [2023-02-17 07:59:03,901 INFO L226 Difference]: Without dead ends: 29 [2023-02-17 07:59:03,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-02-17 07:59:03,903 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-17 07:59:03,904 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-17 07:59:03,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-17 07:59:03,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-17 07:59:03,908 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-17 07:59:03,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2023-02-17 07:59:03,910 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2023-02-17 07:59:03,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:03,910 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2023-02-17 07:59:03,910 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-17 07:59:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2023-02-17 07:59:03,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-17 07:59:03,912 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:03,912 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-17 07:59:03,919 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-17 07:59:04,119 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-17 07:59:04,119 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:04,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:04,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2023-02-17 07:59:04,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:04,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14800545] [2023-02-17 07:59:04,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:04,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 07:59:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,411 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-17 07:59:04,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:04,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14800545] [2023-02-17 07:59:04,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14800545] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:59:04,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944851146] [2023-02-17 07:59:04,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:04,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:04,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:59:04,435 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-17 07:59:04,436 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-17 07:59:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 07:59:04,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:59:04,513 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-17 07:59:04,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:59:04,615 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-17 07:59:04,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944851146] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:59:04,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:59:04,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2023-02-17 07:59:04,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963732969] [2023-02-17 07:59:04,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:59:04,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 07:59:04,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:04,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 07:59:04,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-02-17 07:59:04,617 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-17 07:59:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:04,776 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2023-02-17 07:59:04,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 07:59:04,779 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-17 07:59:04,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:04,785 INFO L225 Difference]: With dead ends: 73 [2023-02-17 07:59:04,785 INFO L226 Difference]: Without dead ends: 44 [2023-02-17 07:59:04,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 134 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2023-02-17 07:59:04,789 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-17 07:59:04,791 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-17 07:59:04,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-17 07:59:04,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-17 07:59:04,799 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-17 07:59:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2023-02-17 07:59:04,801 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 65 [2023-02-17 07:59:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:04,802 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2023-02-17 07:59:04,802 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-17 07:59:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2023-02-17 07:59:04,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-02-17 07:59:04,807 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:04,807 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-17 07:59:04,822 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-17 07:59:05,012 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-17 07:59:05,013 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:05,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:05,013 INFO L85 PathProgramCache]: Analyzing trace with hash -878098806, now seen corresponding path program 2 times [2023-02-17 07:59:05,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:05,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886983461] [2023-02-17 07:59:05,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:05,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 07:59:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:59:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 07:59:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:59:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 07:59:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,414 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-17 07:59:05,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:05,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886983461] [2023-02-17 07:59:05,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886983461] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:59:05,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837035576] [2023-02-17 07:59:05,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 07:59:05,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:05,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:59:05,433 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-17 07:59:05,435 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-17 07:59:05,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 07:59:05,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:59:05,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 07:59:05,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:59:05,554 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-17 07:59:05,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:59:05,665 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-17 07:59:05,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837035576] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:59:05,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:59:05,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 17 [2023-02-17 07:59:05,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392359340] [2023-02-17 07:59:05,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:59:05,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 07:59:05,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:05,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 07:59:05,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-02-17 07:59:05,668 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-17 07:59:05,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:05,791 INFO L93 Difference]: Finished difference Result 101 states and 150 transitions. [2023-02-17 07:59:05,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 07:59:05,792 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-17 07:59:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:05,793 INFO L225 Difference]: With dead ends: 101 [2023-02-17 07:59:05,793 INFO L226 Difference]: Without dead ends: 60 [2023-02-17 07:59:05,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 315 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2023-02-17 07:59:05,794 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-17 07:59:05,795 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-17 07:59:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-17 07:59:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2023-02-17 07:59:05,816 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-17 07:59:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2023-02-17 07:59:05,817 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 144 [2023-02-17 07:59:05,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:05,817 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2023-02-17 07:59:05,817 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-17 07:59:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2023-02-17 07:59:05,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-02-17 07:59:05,819 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:05,819 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-17 07:59:05,826 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-17 07:59:06,024 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-17 07:59:06,024 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:06,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:06,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1511331526, now seen corresponding path program 3 times [2023-02-17 07:59:06,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:06,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730790687] [2023-02-17 07:59:06,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:06,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 07:59:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,416 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-17 07:59:06,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:06,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730790687] [2023-02-17 07:59:06,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730790687] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:59:06,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102611337] [2023-02-17 07:59:06,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 07:59:06,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:06,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:59:06,419 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-17 07:59:06,421 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-17 07:59:06,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-02-17 07:59:06,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:59:06,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 07:59:06,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:59:06,507 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-17 07:59:06,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:59:06,593 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-17 07:59:06,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102611337] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:59:06,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:59:06,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 18 [2023-02-17 07:59:06,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252356851] [2023-02-17 07:59:06,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:59:06,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 07:59:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:06,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 07:59:06,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2023-02-17 07:59:06,596 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-17 07:59:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:06,709 INFO L93 Difference]: Finished difference Result 101 states and 160 transitions. [2023-02-17 07:59:06,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 07:59:06,709 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-17 07:59:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:06,710 INFO L225 Difference]: With dead ends: 101 [2023-02-17 07:59:06,710 INFO L226 Difference]: Without dead ends: 49 [2023-02-17 07:59:06,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 321 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2023-02-17 07:59:06,714 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 31 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 42 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, 42 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:59:06,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 121 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:59:06,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-17 07:59:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-02-17 07:59:06,729 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-17 07:59:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2023-02-17 07:59:06,730 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 147 [2023-02-17 07:59:06,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:06,731 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2023-02-17 07:59:06,731 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-17 07:59:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2023-02-17 07:59:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-02-17 07:59:06,732 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:06,732 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-17 07:59:06,739 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-17 07:59:06,937 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-17 07:59:06,937 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2094125593, now seen corresponding path program 4 times [2023-02-17 07:59:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:06,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388277525] [2023-02-17 07:59:06,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:06,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 07:59:06,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 07:59:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 07:59:06,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 07:59:06,967 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 07:59:06,967 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 07:59:06,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 07:59:06,970 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-02-17 07:59:06,973 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 07:59:06,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 07:59:06 BoogieIcfgContainer [2023-02-17 07:59:06,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 07:59:06,999 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 07:59:06,999 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 07:59:06,999 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 07:59:06,999 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:59:02" (3/4) ... [2023-02-17 07:59:07,000 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 07:59:07,047 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 07:59:07,047 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 07:59:07,048 INFO L158 Benchmark]: Toolchain (without parser) took 4611.00ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 90.0MB in the beginning and 158.8MB in the end (delta: -68.7MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2023-02-17 07:59:07,048 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:59:07,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.78ms. Allocated memory is still 138.4MB. Free memory was 90.0MB in the beginning and 79.9MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 07:59:07,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.10ms. Allocated memory is still 138.4MB. Free memory was 79.4MB in the beginning and 78.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 07:59:07,048 INFO L158 Benchmark]: Boogie Preprocessor took 11.07ms. Allocated memory is still 138.4MB. Free memory was 78.3MB in the beginning and 77.4MB in the end (delta: 841.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:59:07,048 INFO L158 Benchmark]: RCFGBuilder took 187.16ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 77.0MB in the beginning and 169.8MB in the end (delta: -92.8MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2023-02-17 07:59:07,049 INFO L158 Benchmark]: TraceAbstraction took 4171.80ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 168.8MB in the beginning and 161.9MB in the end (delta: 6.9MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2023-02-17 07:59:07,049 INFO L158 Benchmark]: Witness Printer took 48.68ms. Allocated memory is still 243.3MB. Free memory was 161.9MB in the beginning and 158.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 07:59:07,050 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.15ms. Allocated memory is still 138.4MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.78ms. Allocated memory is still 138.4MB. Free memory was 90.0MB in the beginning and 79.9MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.10ms. Allocated memory is still 138.4MB. Free memory was 79.4MB in the beginning and 78.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.07ms. Allocated memory is still 138.4MB. Free memory was 78.3MB in the beginning and 77.4MB in the end (delta: 841.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 187.16ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 77.0MB in the beginning and 169.8MB in the end (delta: -92.8MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4171.80ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 168.8MB in the beginning and 161.9MB in the end (delta: 6.9MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * Witness Printer took 48.68ms. Allocated memory is still 243.3MB. Free memory was 161.9MB in the beginning and 158.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: 4.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.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 443 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 339 mSDsCounter, 169 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 725 IncrementalHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 169 mSolverCounterUnsat, 104 mSDtfsCounter, 725 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 941 GetRequests, 821 SyntacticMatches, 29 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.5s 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 885 NumberOfCodeBlocks, 828 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1144 ConstructedInterpolants, 0 QuantifiedInterpolants, 2160 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-17 07:59:07,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE