./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_5-2.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 02dc726982da9e300f34803a4bdbb3c0165037d3f4471bd0e009c42cfb19ed24 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 06:26:49,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 06:26:49,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 06:26:49,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 06:26:49,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 06:26:49,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 06:26:49,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 06:26:49,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 06:26:49,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 06:26:49,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 06:26:49,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 06:26:49,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 06:26:49,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 06:26:49,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 06:26:49,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 06:26:49,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 06:26:49,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 06:26:49,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 06:26:49,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 06:26:49,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 06:26:49,432 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 06:26:49,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 06:26:49,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 06:26:49,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 06:26:49,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 06:26:49,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 06:26:49,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 06:26:49,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 06:26:49,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 06:26:49,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 06:26:49,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 06:26:49,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 06:26:49,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 06:26:49,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 06:26:49,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 06:26:49,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 06:26:49,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 06:26:49,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 06:26:49,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 06:26:49,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 06:26:49,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 06:26:49,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 06:26:49,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 06:26:49,481 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 06:26:49,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 06:26:49,482 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 06:26:49,482 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 06:26:49,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 06:26:49,483 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 06:26:49,483 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 06:26:49,483 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 06:26:49,484 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 06:26:49,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 06:26:49,485 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 06:26:49,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 06:26:49,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 06:26:49,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 06:26:49,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 06:26:49,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 06:26:49,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 06:26:49,486 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 06:26:49,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 06:26:49,486 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 06:26:49,486 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 06:26:49,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 06:26:49,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 06:26:49,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 06:26:49,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:26:49,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 06:26:49,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 06:26:49,488 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 06:26:49,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 06:26:49,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 06:26:49,488 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 06:26:49,489 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 06:26:49,489 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 06:26:49,489 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 02dc726982da9e300f34803a4bdbb3c0165037d3f4471bd0e009c42cfb19ed24 [2022-07-12 06:26:49,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 06:26:49,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 06:26:49,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 06:26:49,770 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 06:26:49,771 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 06:26:49,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_5-2.c [2022-07-12 06:26:49,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3615064d9/79db6c34acee4072b37cec78473d6c66/FLAG4867941b2 [2022-07-12 06:26:50,256 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 06:26:50,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_5-2.c [2022-07-12 06:26:50,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3615064d9/79db6c34acee4072b37cec78473d6c66/FLAG4867941b2 [2022-07-12 06:26:50,271 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3615064d9/79db6c34acee4072b37cec78473d6c66 [2022-07-12 06:26:50,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 06:26:50,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 06:26:50,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 06:26:50,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 06:26:50,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 06:26:50,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:26:50" (1/1) ... [2022-07-12 06:26:50,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f622424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:26:50, skipping insertion in model container [2022-07-12 06:26:50,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:26:50" (1/1) ... [2022-07-12 06:26:50,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 06:26:50,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 06:26:50,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_5-2.c[740,753] [2022-07-12 06:26:50,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:26:50,469 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 06:26:50,482 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_5-2.c[740,753] [2022-07-12 06:26:50,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:26:50,494 INFO L208 MainTranslator]: Completed translation [2022-07-12 06:26:50,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:26:50 WrapperNode [2022-07-12 06:26:50,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 06:26:50,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 06:26:50,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 06:26:50,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 06:26:50,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:26:50" (1/1) ... [2022-07-12 06:26:50,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:26:50" (1/1) ... [2022-07-12 06:26:50,521 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-07-12 06:26:50,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 06:26:50,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 06:26:50,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 06:26:50,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 06:26:50,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:26:50" (1/1) ... [2022-07-12 06:26:50,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:26:50" (1/1) ... [2022-07-12 06:26:50,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:26:50" (1/1) ... [2022-07-12 06:26:50,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:26:50" (1/1) ... [2022-07-12 06:26:50,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:26:50" (1/1) ... [2022-07-12 06:26:50,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:26:50" (1/1) ... [2022-07-12 06:26:50,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:26:50" (1/1) ... [2022-07-12 06:26:50,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 06:26:50,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 06:26:50,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 06:26:50,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 06:26:50,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:26:50" (1/1) ... [2022-07-12 06:26:50,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:26:50,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:26:50,576 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 06:26:50,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 06:26:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 06:26:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 06:26:50,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 06:26:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 06:26:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2022-07-12 06:26:50,618 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2022-07-12 06:26:50,666 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 06:26:50,668 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 06:26:50,777 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 06:26:50,783 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 06:26:50,785 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 06:26:50,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:26:50 BoogieIcfgContainer [2022-07-12 06:26:50,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 06:26:50,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 06:26:50,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 06:26:50,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 06:26:50,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:26:50" (1/3) ... [2022-07-12 06:26:50,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5379da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:26:50, skipping insertion in model container [2022-07-12 06:26:50,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:26:50" (2/3) ... [2022-07-12 06:26:50,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5379da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:26:50, skipping insertion in model container [2022-07-12 06:26:50,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:26:50" (3/3) ... [2022-07-12 06:26:50,795 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_5-2.c [2022-07-12 06:26:50,807 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 06:26:50,808 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 06:26:50,866 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 06:26:50,876 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50418b6f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@734c8244 [2022-07-12 06:26:50,876 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 06:26:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 06:26:50,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 06:26:50,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:26:50,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:26:50,896 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:26:50,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:26:50,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2022-07-12 06:26:50,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:26:50,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335134482] [2022-07-12 06:26:50,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:26:50,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:26:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:51,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:26:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 06:26:51,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:26:51,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335134482] [2022-07-12 06:26:51,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335134482] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:26:51,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:26:51,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:26:51,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873006799] [2022-07-12 06:26:51,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:26:51,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:26:51,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:26:51,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:26:51,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:26:51,182 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 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), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 06:26:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:26:51,245 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-07-12 06:26:51,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:26:51,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-07-12 06:26:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:26:51,254 INFO L225 Difference]: With dead ends: 34 [2022-07-12 06:26:51,255 INFO L226 Difference]: Without dead ends: 18 [2022-07-12 06:26:51,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:26:51,264 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:26:51,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:26:51,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-12 06:26:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-12 06:26:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 06:26:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-12 06:26:51,306 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-07-12 06:26:51,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:26:51,306 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-12 06:26:51,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 06:26:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-07-12 06:26:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 06:26:51,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:26:51,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:26:51,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 06:26:51,311 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:26:51,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:26:51,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2022-07-12 06:26:51,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:26:51,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176084740] [2022-07-12 06:26:51,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:26:51,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:26:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:51,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:26:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 06:26:51,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:26:51,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176084740] [2022-07-12 06:26:51,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176084740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:26:51,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:26:51,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:26:51,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529640021] [2022-07-12 06:26:51,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:26:51,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:26:51,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:26:51,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:26:51,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:26:51,407 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), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 06:26:51,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:26:51,425 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-07-12 06:26:51,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:26:51,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-07-12 06:26:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:26:51,427 INFO L225 Difference]: With dead ends: 24 [2022-07-12 06:26:51,427 INFO L226 Difference]: Without dead ends: 20 [2022-07-12 06:26:51,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:26:51,429 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:26:51,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:26:51,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-12 06:26:51,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-12 06:26:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 06:26:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-12 06:26:51,434 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-07-12 06:26:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:26:51,435 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-12 06:26:51,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 06:26:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-07-12 06:26:51,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 06:26:51,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:26:51,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:26:51,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 06:26:51,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:26:51,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:26:51,439 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2022-07-12 06:26:51,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:26:51,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757616503] [2022-07-12 06:26:51,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:26:51,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:26:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:51,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:26:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:51,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:51,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 06:26:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 06:26:51,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:26:51,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757616503] [2022-07-12 06:26:51,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757616503] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:26:51,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279031345] [2022-07-12 06:26:51,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:26:51,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:26:51,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:26:51,539 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:26:51,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 06:26:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:51,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 06:26:51,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:26:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 06:26:51,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:26:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 06:26:51,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279031345] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:26:51,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:26:51,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-07-12 06:26:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273706243] [2022-07-12 06:26:51,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:26:51,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 06:26:51,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:26:51,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 06:26:51,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-12 06:26:51,826 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 06:26:51,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:26:51,930 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-07-12 06:26:51,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 06:26:51,930 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2022-07-12 06:26:51,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:26:51,931 INFO L225 Difference]: With dead ends: 35 [2022-07-12 06:26:51,932 INFO L226 Difference]: Without dead ends: 20 [2022-07-12 06:26:51,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-07-12 06:26:51,933 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 41 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:26:51,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 48 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:26:51,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-12 06:26:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-12 06:26:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 06:26:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-12 06:26:51,947 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2022-07-12 06:26:51,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:26:51,947 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-12 06:26:51,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 06:26:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-12 06:26:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 06:26:51,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:26:51,951 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:26:51,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 06:26:52,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:26:52,168 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:26:52,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:26:52,168 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2022-07-12 06:26:52,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:26:52,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938012282] [2022-07-12 06:26:52,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:26:52,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:26:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:52,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:26:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:52,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:52,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:26:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 06:26:52,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:26:52,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938012282] [2022-07-12 06:26:52,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938012282] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:26:52,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175148923] [2022-07-12 06:26:52,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:26:52,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:26:52,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:26:52,272 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:26:52,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 06:26:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:52,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 06:26:52,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:26:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 06:26:52,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:26:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 06:26:52,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175148923] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:26:52,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:26:52,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2022-07-12 06:26:52,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084212885] [2022-07-12 06:26:52,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:26:52,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 06:26:52,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:26:52,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 06:26:52,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-12 06:26:52,593 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-12 06:26:52,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:26:52,658 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-07-12 06:26:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 06:26:52,658 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2022-07-12 06:26:52,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:26:52,660 INFO L225 Difference]: With dead ends: 38 [2022-07-12 06:26:52,660 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 06:26:52,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-12 06:26:52,662 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:26:52,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 62 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:26:52,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 06:26:52,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-12 06:26:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-12 06:26:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-07-12 06:26:52,669 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2022-07-12 06:26:52,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:26:52,670 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2022-07-12 06:26:52,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-12 06:26:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-07-12 06:26:52,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 06:26:52,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:26:52,672 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:26:52,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 06:26:52,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-12 06:26:52,884 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:26:52,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:26:52,884 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2022-07-12 06:26:52,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:26:52,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298607543] [2022-07-12 06:26:52,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:26:52,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:26:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:52,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:26:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:52,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:53,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:53,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:26:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:53,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:26:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 06:26:53,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:26:53,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298607543] [2022-07-12 06:26:53,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298607543] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:26:53,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613104084] [2022-07-12 06:26:53,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 06:26:53,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:26:53,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:26:53,037 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:26:53,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 06:26:53,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 06:26:53,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:26:53,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 06:26:53,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:26:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 06:26:53,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:26:53,482 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 06:26:53,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613104084] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:26:53,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:26:53,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2022-07-12 06:26:53,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298023579] [2022-07-12 06:26:53,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:26:53,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 06:26:53,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:26:53,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 06:26:53,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-07-12 06:26:53,486 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2022-07-12 06:26:53,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:26:53,652 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2022-07-12 06:26:53,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 06:26:53,653 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2022-07-12 06:26:53,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:26:53,655 INFO L225 Difference]: With dead ends: 69 [2022-07-12 06:26:53,655 INFO L226 Difference]: Without dead ends: 38 [2022-07-12 06:26:53,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2022-07-12 06:26:53,658 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:26:53,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 77 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:26:53,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-12 06:26:53,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-12 06:26:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-12 06:26:53,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-07-12 06:26:53,669 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2022-07-12 06:26:53,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:26:53,669 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-07-12 06:26:53,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2022-07-12 06:26:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-07-12 06:26:53,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 06:26:53,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:26:53,673 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:26:53,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 06:26:53,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:26:53,880 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:26:53,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:26:53,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 3 times [2022-07-12 06:26:53,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:26:53,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418058047] [2022-07-12 06:26:53,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:26:53,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:26:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:53,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:26:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:54,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:54,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:54,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:26:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:54,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:26:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:54,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 06:26:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:54,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:54,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:26:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-12 06:26:54,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:26:54,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418058047] [2022-07-12 06:26:54,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418058047] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:26:54,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928877224] [2022-07-12 06:26:54,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 06:26:54,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:26:54,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:26:54,107 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:26:54,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 06:26:54,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-12 06:26:54,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:26:54,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 06:26:54,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:26:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-12 06:26:54,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:26:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 29 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-07-12 06:26:54,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928877224] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:26:54,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:26:54,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 16 [2022-07-12 06:26:54,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290587491] [2022-07-12 06:26:54,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:26:54,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 06:26:54,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:26:54,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 06:26:54,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-07-12 06:26:54,523 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) [2022-07-12 06:26:54,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:26:54,651 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2022-07-12 06:26:54,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 06:26:54,652 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) Word has length 65 [2022-07-12 06:26:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:26:54,654 INFO L225 Difference]: With dead ends: 85 [2022-07-12 06:26:54,654 INFO L226 Difference]: Without dead ends: 50 [2022-07-12 06:26:54,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 139 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2022-07-12 06:26:54,655 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:26:54,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 62 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:26:54,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-12 06:26:54,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-07-12 06:26:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2022-07-12 06:26:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-07-12 06:26:54,663 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 65 [2022-07-12 06:26:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:26:54,664 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2022-07-12 06:26:54,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) [2022-07-12 06:26:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-07-12 06:26:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 06:26:54,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:26:54,666 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:26:54,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 06:26:54,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:26:54,879 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:26:54,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:26:54,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1033750100, now seen corresponding path program 4 times [2022-07-12 06:26:54,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:26:54,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458254911] [2022-07-12 06:26:54,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:26:54,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:26:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:54,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:26:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:26:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:26:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 06:26:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:26:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 06:26:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:26:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 06:26:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 06:26:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:26:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:26:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 06:26:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:26:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 281 proven. 331 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-07-12 06:26:55,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:26:55,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458254911] [2022-07-12 06:26:55,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458254911] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:26:55,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629897538] [2022-07-12 06:26:55,298 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 06:26:55,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:26:55,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:26:55,300 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:26:55,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 06:26:55,378 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 06:26:55,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:26:55,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 06:26:55,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:26:55,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 327 proven. 131 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2022-07-12 06:26:55,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:26:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 327 proven. 153 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-07-12 06:26:56,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629897538] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:26:56,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:26:56,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 13] total 27 [2022-07-12 06:26:56,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977972373] [2022-07-12 06:26:56,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:26:56,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 06:26:56,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:26:56,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 06:26:56,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2022-07-12 06:26:56,286 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 19 states have call successors, (24), 1 states have call predecessors, (24), 11 states have return successors, (33), 19 states have call predecessors, (33), 19 states have call successors, (33) [2022-07-12 06:26:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:26:56,763 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2022-07-12 06:26:56,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 06:26:56,764 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 19 states have call successors, (24), 1 states have call predecessors, (24), 11 states have return successors, (33), 19 states have call predecessors, (33), 19 states have call successors, (33) Word has length 147 [2022-07-12 06:26:56,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:26:56,765 INFO L225 Difference]: With dead ends: 117 [2022-07-12 06:26:56,765 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 06:26:56,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 327 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=1246, Unknown=0, NotChecked=0, Total=1640 [2022-07-12 06:26:56,768 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 111 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 06:26:56,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 182 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 06:26:56,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 06:26:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2022-07-12 06:26:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.05) internal successors, (42), 38 states have internal predecessors, (42), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (16), 10 states have call predecessors, (16), 9 states have call successors, (16) [2022-07-12 06:26:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-07-12 06:26:56,776 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 147 [2022-07-12 06:26:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:26:56,777 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-07-12 06:26:56,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 states have internal predecessors, (70), 19 states have call successors, (24), 1 states have call predecessors, (24), 11 states have return successors, (33), 19 states have call predecessors, (33), 19 states have call successors, (33) [2022-07-12 06:26:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-07-12 06:26:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 06:26:56,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:26:56,779 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:26:56,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 06:26:57,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:26:57,004 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:26:57,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:26:57,004 INFO L85 PathProgramCache]: Analyzing trace with hash -292645265, now seen corresponding path program 5 times [2022-07-12 06:26:57,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:26:57,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634666898] [2022-07-12 06:26:57,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:26:57,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:26:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:26:57,023 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 06:26:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:26:57,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 06:26:57,054 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 06:26:57,055 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 06:26:57,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 06:26:57,060 INFO L356 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2022-07-12 06:26:57,063 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 06:26:57,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:26:57 BoogieIcfgContainer [2022-07-12 06:26:57,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 06:26:57,119 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 06:26:57,120 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 06:26:57,120 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 06:26:57,120 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:26:50" (3/4) ... [2022-07-12 06:26:57,122 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 06:26:57,183 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 06:26:57,184 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 06:26:57,184 INFO L158 Benchmark]: Toolchain (without parser) took 6909.34ms. Allocated memory was 119.5MB in the beginning and 180.4MB in the end (delta: 60.8MB). Free memory was 87.4MB in the beginning and 122.7MB in the end (delta: -35.3MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2022-07-12 06:26:57,185 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory was 43.5MB in the beginning and 43.5MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:26:57,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.17ms. Allocated memory is still 119.5MB. Free memory was 87.1MB in the beginning and 95.9MB in the end (delta: -8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 06:26:57,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.03ms. Allocated memory is still 119.5MB. Free memory was 95.9MB in the beginning and 94.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:26:57,186 INFO L158 Benchmark]: Boogie Preprocessor took 18.03ms. Allocated memory is still 119.5MB. Free memory was 94.4MB in the beginning and 93.6MB in the end (delta: 822.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:26:57,186 INFO L158 Benchmark]: RCFGBuilder took 244.52ms. Allocated memory is still 119.5MB. Free memory was 93.6MB in the beginning and 85.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 06:26:57,186 INFO L158 Benchmark]: TraceAbstraction took 6329.98ms. Allocated memory was 119.5MB in the beginning and 180.4MB in the end (delta: 60.8MB). Free memory was 84.3MB in the beginning and 126.8MB in the end (delta: -42.5MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2022-07-12 06:26:57,187 INFO L158 Benchmark]: Witness Printer took 64.23ms. Allocated memory is still 180.4MB. Free memory was 125.8MB in the beginning and 122.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:26:57,189 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.17ms. Allocated memory is still 86.0MB. Free memory was 43.5MB in the beginning and 43.5MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.17ms. Allocated memory is still 119.5MB. Free memory was 87.1MB in the beginning and 95.9MB in the end (delta: -8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.03ms. Allocated memory is still 119.5MB. Free memory was 95.9MB in the beginning and 94.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.03ms. Allocated memory is still 119.5MB. Free memory was 94.4MB in the beginning and 93.6MB in the end (delta: 822.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 244.52ms. Allocated memory is still 119.5MB. Free memory was 93.6MB in the beginning and 85.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6329.98ms. Allocated memory was 119.5MB in the beginning and 180.4MB in the end (delta: 60.8MB). Free memory was 84.3MB in the beginning and 126.8MB in the end (delta: -42.5MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Witness Printer took 64.23ms. Allocated memory is still 180.4MB. Free memory was 125.8MB in the beginning and 122.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 5; VAL [x=5] [L27] CALL, EXPR fibo(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [fibo(x)=5, x=5] [L27] int result = fibo(x); [L28] COND TRUE result == 5 VAL [result=5, x=5] [L29] reach_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 309 mSDsluCounter, 580 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 450 mSDsCounter, 275 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 863 IncrementalHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 275 mSolverCounterUnsat, 130 mSDtfsCounter, 863 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 762 GetRequests, 648 SyntacticMatches, 8 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=7, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 719 NumberOfCodeBlocks, 674 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 892 ConstructedInterpolants, 0 QuantifiedInterpolants, 1859 SizeOfPredicates, 15 NumberOfNonLiveVariables, 637 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 3405/4251 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-12 06:26:57,232 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