./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c 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_2calls_10-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 ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 02:36:35,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:36:35,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:36:35,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:36:35,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:36:35,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:36:35,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:36:35,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:36:35,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:36:35,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:36:35,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:36:35,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:36:35,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:36:35,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:36:35,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:36:35,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:36:35,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:36:35,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:36:35,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:36:35,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:36:35,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:36:35,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:36:35,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:36:35,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:36:35,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:36:35,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:36:35,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:36:35,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:36:35,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:36:35,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:36:35,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:36:35,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:36:35,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:36:35,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:36:35,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:36:35,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:36:35,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:36:35,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:36:35,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:36:35,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:36:35,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:36:35,674 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 02:36:35,685 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:36:35,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:36:35,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:36:35,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:36:35,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:36:35,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:36:35,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:36:35,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:36:35,687 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:36:35,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:36:35,688 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:36:35,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:36:35,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:36:35,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:36:35,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 02:36:35,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:36:35,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 02:36:35,689 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:36:35,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 02:36:35,689 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:36:35,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 02:36:35,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:36:35,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:36:35,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:36:35,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:36:35,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:36:35,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:36:35,690 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 02:36:35,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 02:36:35,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 02:36:35,691 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:36:35,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 02:36:35,691 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:36:35,691 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:36:35,692 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:36:35,692 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db [2023-02-17 02:36:35,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:36:35,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:36:35,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:36:35,934 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:36:35,935 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:36:35,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2023-02-17 02:36:37,044 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:36:37,246 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:36:37,247 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2023-02-17 02:36:37,253 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d35202ee9/618dbf90ed3749a7874cf1d4ae9e2c1e/FLAG1b6825d8a [2023-02-17 02:36:37,272 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d35202ee9/618dbf90ed3749a7874cf1d4ae9e2c1e [2023-02-17 02:36:37,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:36:37,278 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:36:37,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:36:37,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:36:37,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:36:37,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:36:37" (1/1) ... [2023-02-17 02:36:37,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cfb04aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:36:37, skipping insertion in model container [2023-02-17 02:36:37,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:36:37" (1/1) ... [2023-02-17 02:36:37,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:36:37,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:36:37,528 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2023-02-17 02:36:37,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:36:37,548 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 02:36:37,570 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2023-02-17 02:36:37,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:36:37,584 INFO L208 MainTranslator]: Completed translation [2023-02-17 02:36:37,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:36:37 WrapperNode [2023-02-17 02:36:37,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:36:37,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 02:36:37,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 02:36:37,587 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 02:36:37,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:36:37" (1/1) ... [2023-02-17 02:36:37,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:36:37" (1/1) ... [2023-02-17 02:36:37,619 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2023-02-17 02:36:37,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 02:36:37,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 02:36:37,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 02:36:37,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 02:36:37,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:36:37" (1/1) ... [2023-02-17 02:36:37,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:36:37" (1/1) ... [2023-02-17 02:36:37,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:36:37" (1/1) ... [2023-02-17 02:36:37,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:36:37" (1/1) ... [2023-02-17 02:36:37,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:36:37" (1/1) ... [2023-02-17 02:36:37,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:36:37" (1/1) ... [2023-02-17 02:36:37,654 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:36:37" (1/1) ... [2023-02-17 02:36:37,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:36:37" (1/1) ... [2023-02-17 02:36:37,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 02:36:37,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 02:36:37,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 02:36:37,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 02:36:37,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:36:37" (1/1) ... [2023-02-17 02:36:37,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:36:37,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:36:37,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 02:36:37,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 02:36:37,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 02:36:37,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 02:36:37,767 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-02-17 02:36:37,767 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-02-17 02:36:37,767 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-02-17 02:36:37,767 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-02-17 02:36:37,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 02:36:37,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 02:36:37,812 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 02:36:37,814 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 02:36:37,926 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 02:36:37,934 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 02:36:37,935 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 02:36:37,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:36:37 BoogieIcfgContainer [2023-02-17 02:36:37,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 02:36:37,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 02:36:37,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 02:36:37,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 02:36:37,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 02:36:37" (1/3) ... [2023-02-17 02:36:37,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fac4ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:36:37, skipping insertion in model container [2023-02-17 02:36:37,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:36:37" (2/3) ... [2023-02-17 02:36:37,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fac4ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:36:37, skipping insertion in model container [2023-02-17 02:36:37,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:36:37" (3/3) ... [2023-02-17 02:36:37,946 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2023-02-17 02:36:37,957 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 02:36:37,958 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 02:36:37,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 02:36:38,004 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@152536ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 02:36:38,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 02:36:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 02:36:38,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 02:36:38,013 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:36:38,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:36:38,014 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:36:38,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:36:38,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2023-02-17 02:36:38,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:36:38,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377723363] [2023-02-17 02:36:38,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:38,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:36:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:38,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:36:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:36:38,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:36:38,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377723363] [2023-02-17 02:36:38,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377723363] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:36:38,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:36:38,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:36:38,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013702697] [2023-02-17 02:36:38,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:36:38,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:36:38,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:36:38,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:36:38,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:36:38,311 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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) [2023-02-17 02:36:38,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:36:38,367 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2023-02-17 02:36:38,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:36:38,375 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 [2023-02-17 02:36:38,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:36:38,383 INFO L225 Difference]: With dead ends: 43 [2023-02-17 02:36:38,383 INFO L226 Difference]: Without dead ends: 27 [2023-02-17 02:36:38,386 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 [2023-02-17 02:36:38,389 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 123 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 [2023-02-17 02:36:38,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 123 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:36:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-17 02:36:38,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-17 02:36:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-17 02:36:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-02-17 02:36:38,422 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2023-02-17 02:36:38,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:36:38,422 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-02-17 02:36:38,423 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) [2023-02-17 02:36:38,423 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-02-17 02:36:38,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 02:36:38,424 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:36:38,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:36:38,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 02:36:38,424 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:36:38,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:36:38,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2023-02-17 02:36:38,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:36:38,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836060793] [2023-02-17 02:36:38,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:38,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:36:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:38,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:36:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:36:38,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:36:38,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836060793] [2023-02-17 02:36:38,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836060793] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:36:38,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:36:38,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:36:38,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617644212] [2023-02-17 02:36:38,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:36:38,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:36:38,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:36:38,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:36:38,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:36:38,503 INFO L87 Difference]: Start difference. First operand 27 states and 34 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) [2023-02-17 02:36:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:36:38,539 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2023-02-17 02:36:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:36:38,539 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 [2023-02-17 02:36:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:36:38,540 INFO L225 Difference]: With dead ends: 33 [2023-02-17 02:36:38,541 INFO L226 Difference]: Without dead ends: 29 [2023-02-17 02:36:38,541 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 [2023-02-17 02:36:38,542 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 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 [2023-02-17 02:36:38,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:36:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-17 02:36:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-02-17 02:36:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-17 02:36:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-02-17 02:36:38,552 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2023-02-17 02:36:38,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:36:38,552 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-02-17 02:36:38,553 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) [2023-02-17 02:36:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-02-17 02:36:38,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 02:36:38,554 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:36:38,557 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:36:38,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 02:36:38,558 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:36:38,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:36:38,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2023-02-17 02:36:38,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:36:38,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187131527] [2023-02-17 02:36:38,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:38,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:36:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:38,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:36:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:38,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:38,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 02:36:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:36:38,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:36:38,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187131527] [2023-02-17 02:36:38,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187131527] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:36:38,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076879742] [2023-02-17 02:36:38,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:38,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:38,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:36:38,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:36:38,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 02:36:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:38,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 02:36:38,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:36:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:36:38,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:36:39,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:36:39,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076879742] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:36:39,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:36:39,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2023-02-17 02:36:39,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775618968] [2023-02-17 02:36:39,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:36:39,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 02:36:39,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:36:39,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 02:36:39,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-17 02:36:39,076 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 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) [2023-02-17 02:36:39,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:36:39,229 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2023-02-17 02:36:39,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 02:36:39,230 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 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 [2023-02-17 02:36:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:36:39,230 INFO L225 Difference]: With dead ends: 55 [2023-02-17 02:36:39,231 INFO L226 Difference]: Without dead ends: 31 [2023-02-17 02:36:39,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2023-02-17 02:36:39,232 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:36:39,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 112 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:36:39,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-17 02:36:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-02-17 02:36:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-17 02:36:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-02-17 02:36:39,237 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2023-02-17 02:36:39,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:36:39,238 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-02-17 02:36:39,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 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) [2023-02-17 02:36:39,238 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-02-17 02:36:39,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 02:36:39,239 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:36:39,239 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:36:39,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 02:36:39,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:39,445 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:36:39,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:36:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2023-02-17 02:36:39,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:36:39,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862001719] [2023-02-17 02:36:39,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:39,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:36:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:39,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:36:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:39,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:39,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:36:39,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:36:39,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862001719] [2023-02-17 02:36:39,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862001719] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:36:39,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275926786] [2023-02-17 02:36:39,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:39,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:39,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:36:39,526 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:36:39,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 02:36:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:39,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 02:36:39,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:36:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:36:39,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:36:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:36:39,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275926786] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:36:39,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:36:39,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2023-02-17 02:36:39,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883505469] [2023-02-17 02:36:39,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:36:39,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 02:36:39,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:36:39,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 02:36:39,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-17 02:36:39,633 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 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) [2023-02-17 02:36:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:36:39,758 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2023-02-17 02:36:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:36:39,759 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 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 [2023-02-17 02:36:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:36:39,761 INFO L225 Difference]: With dead ends: 51 [2023-02-17 02:36:39,762 INFO L226 Difference]: Without dead ends: 47 [2023-02-17 02:36:39,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-02-17 02:36:39,763 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:36:39,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 92 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:36:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-17 02:36:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-02-17 02:36:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2023-02-17 02:36:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2023-02-17 02:36:39,772 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2023-02-17 02:36:39,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:36:39,773 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2023-02-17 02:36:39,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 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) [2023-02-17 02:36:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2023-02-17 02:36:39,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 02:36:39,774 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:36:39,774 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:36:39,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 02:36:39,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-17 02:36:39,980 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:36:39,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:36:39,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2023-02-17 02:36:39,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:36:39,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966569740] [2023-02-17 02:36:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:39,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:36:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:40,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:36:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:40,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:40,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:40,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 02:36:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:40,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-17 02:36:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 02:36:40,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:36:40,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966569740] [2023-02-17 02:36:40,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966569740] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:36:40,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790179207] [2023-02-17 02:36:40,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:40,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:40,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:36:40,084 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:36:40,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 02:36:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:40,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 02:36:40,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:36:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 02:36:40,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:36:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 02:36:40,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790179207] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:36:40,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:36:40,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2023-02-17 02:36:40,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693186881] [2023-02-17 02:36:40,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:36:40,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 02:36:40,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:36:40,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 02:36:40,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-02-17 02:36:40,238 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2023-02-17 02:36:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:36:40,382 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2023-02-17 02:36:40,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 02:36:40,383 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2023-02-17 02:36:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:36:40,384 INFO L225 Difference]: With dead ends: 105 [2023-02-17 02:36:40,384 INFO L226 Difference]: Without dead ends: 63 [2023-02-17 02:36:40,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-02-17 02:36:40,385 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 57 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:36:40,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 95 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:36:40,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-17 02:36:40,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-17 02:36:40,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2023-02-17 02:36:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2023-02-17 02:36:40,393 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2023-02-17 02:36:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:36:40,393 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2023-02-17 02:36:40,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2023-02-17 02:36:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2023-02-17 02:36:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 02:36:40,394 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:36:40,394 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:36:40,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 02:36:40,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:40,599 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:36:40,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:36:40,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2023-02-17 02:36:40,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:36:40,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151618538] [2023-02-17 02:36:40,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:40,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:36:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:40,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:36:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:40,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:40,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:40,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:40,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-17 02:36:40,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:36:40,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151618538] [2023-02-17 02:36:40,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151618538] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:36:40,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042651003] [2023-02-17 02:36:40,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:40,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:40,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:36:40,770 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:36:40,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 02:36:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:40,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 02:36:40,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:36:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 02:36:40,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:36:40,915 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 02:36:40,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042651003] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:36:40,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:36:40,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2023-02-17 02:36:40,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131070935] [2023-02-17 02:36:40,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:36:40,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 02:36:40,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:36:40,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 02:36:40,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-02-17 02:36:40,917 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2023-02-17 02:36:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:36:41,183 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2023-02-17 02:36:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 02:36:41,184 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2023-02-17 02:36:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:36:41,185 INFO L225 Difference]: With dead ends: 177 [2023-02-17 02:36:41,185 INFO L226 Difference]: Without dead ends: 117 [2023-02-17 02:36:41,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2023-02-17 02:36:41,187 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:36:41,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 222 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:36:41,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-17 02:36:41,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2023-02-17 02:36:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2023-02-17 02:36:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2023-02-17 02:36:41,199 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2023-02-17 02:36:41,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:36:41,199 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2023-02-17 02:36:41,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2023-02-17 02:36:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2023-02-17 02:36:41,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-17 02:36:41,201 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:36:41,201 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:36:41,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 02:36:41,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:41,405 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:36:41,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:36:41,406 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2023-02-17 02:36:41,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:36:41,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631135046] [2023-02-17 02:36:41,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:41,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:36:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:41,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:36:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:41,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:41,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:41,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:41,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:41,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:41,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 02:36:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-17 02:36:41,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:36:41,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631135046] [2023-02-17 02:36:41,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631135046] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:36:41,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629526517] [2023-02-17 02:36:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:41,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:41,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:36:41,525 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) [2023-02-17 02:36:41,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 02:36:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:41,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 02:36:41,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:36:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-17 02:36:41,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:36:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 02:36:41,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629526517] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:36:41,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:36:41,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2023-02-17 02:36:41,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635318483] [2023-02-17 02:36:41,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:36:41,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-17 02:36:41,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:36:41,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-17 02:36:41,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:36:41,692 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2023-02-17 02:36:42,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:36:42,013 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2023-02-17 02:36:42,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-17 02:36:42,013 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 51 [2023-02-17 02:36:42,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:36:42,015 INFO L225 Difference]: With dead ends: 255 [2023-02-17 02:36:42,015 INFO L226 Difference]: Without dead ends: 155 [2023-02-17 02:36:42,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 105 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2023-02-17 02:36:42,017 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:36:42,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 227 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:36:42,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-17 02:36:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2023-02-17 02:36:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2023-02-17 02:36:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2023-02-17 02:36:42,042 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2023-02-17 02:36:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:36:42,043 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2023-02-17 02:36:42,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2023-02-17 02:36:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2023-02-17 02:36:42,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-02-17 02:36:42,046 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:36:42,046 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:36:42,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-17 02:36:42,249 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 [2023-02-17 02:36:42,250 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:36:42,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:36:42,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1770426885, now seen corresponding path program 1 times [2023-02-17 02:36:42,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:36:42,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939747411] [2023-02-17 02:36:42,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:42,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:36:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:36:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 02:36:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 79 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-17 02:36:42,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:36:42,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939747411] [2023-02-17 02:36:42,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939747411] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:36:42,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843887139] [2023-02-17 02:36:42,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:42,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:42,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:36:42,507 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:36:42,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 02:36:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:42,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 02:36:42,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:36:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 119 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-02-17 02:36:42,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:36:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 129 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2023-02-17 02:36:42,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843887139] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:36:42,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:36:42,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2023-02-17 02:36:42,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672526220] [2023-02-17 02:36:42,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:36:42,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-17 02:36:42,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:36:42,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-17 02:36:42,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2023-02-17 02:36:42,764 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 24 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 24 states have internal predecessors, (76), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2023-02-17 02:36:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:36:43,120 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2023-02-17 02:36:43,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-17 02:36:43,121 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 24 states have internal predecessors, (76), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) Word has length 107 [2023-02-17 02:36:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:36:43,122 INFO L225 Difference]: With dead ends: 240 [2023-02-17 02:36:43,122 INFO L226 Difference]: Without dead ends: 107 [2023-02-17 02:36:43,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 222 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 02:36:43,124 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 89 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:36:43,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 201 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:36:43,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-17 02:36:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2023-02-17 02:36:43,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (35), 17 states have call predecessors, (35), 14 states have call successors, (35) [2023-02-17 02:36:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2023-02-17 02:36:43,131 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 107 [2023-02-17 02:36:43,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:36:43,131 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2023-02-17 02:36:43,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 24 states have internal predecessors, (76), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2023-02-17 02:36:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2023-02-17 02:36:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-02-17 02:36:43,134 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:36:43,134 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:36:43,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 02:36:43,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:43,339 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:36:43,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:36:43,340 INFO L85 PathProgramCache]: Analyzing trace with hash -222615371, now seen corresponding path program 1 times [2023-02-17 02:36:43,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:36:43,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953183796] [2023-02-17 02:36:43,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:43,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:36:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:36:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 02:36:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-02-17 02:36:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-17 02:36:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 62 proven. 123 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2023-02-17 02:36:43,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:36:43,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953183796] [2023-02-17 02:36:43,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953183796] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:36:43,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762045967] [2023-02-17 02:36:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:43,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:43,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:36:43,685 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:36:43,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 02:36:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:43,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 02:36:43,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:36:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 25 proven. 190 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2023-02-17 02:36:43,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:36:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 25 proven. 206 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2023-02-17 02:36:44,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762045967] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:36:44,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:36:44,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 26 [2023-02-17 02:36:44,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452608294] [2023-02-17 02:36:44,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:36:44,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-17 02:36:44,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:36:44,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 02:36:44,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2023-02-17 02:36:44,073 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 26 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 26 states have internal predecessors, (83), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2023-02-17 02:36:44,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:36:44,424 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2023-02-17 02:36:44,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-17 02:36:44,425 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 26 states have internal predecessors, (83), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) Word has length 134 [2023-02-17 02:36:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:36:44,426 INFO L225 Difference]: With dead ends: 214 [2023-02-17 02:36:44,426 INFO L226 Difference]: Without dead ends: 134 [2023-02-17 02:36:44,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 281 SyntacticMatches, 12 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2023-02-17 02:36:44,428 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 75 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:36:44,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 208 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:36:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-17 02:36:44,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2023-02-17 02:36:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 78 states have internal predecessors, (93), 20 states have call successors, (20), 11 states have call predecessors, (20), 16 states have return successors, (56), 24 states have call predecessors, (56), 20 states have call successors, (56) [2023-02-17 02:36:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2023-02-17 02:36:44,456 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 134 [2023-02-17 02:36:44,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:36:44,457 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2023-02-17 02:36:44,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 26 states have internal predecessors, (83), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2023-02-17 02:36:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2023-02-17 02:36:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2023-02-17 02:36:44,459 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:36:44,460 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 26, 26, 25, 22, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 8, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:36:44,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-17 02:36:44,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:44,665 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:36:44,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:36:44,666 INFO L85 PathProgramCache]: Analyzing trace with hash 12289001, now seen corresponding path program 1 times [2023-02-17 02:36:44,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:36:44,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679669248] [2023-02-17 02:36:44,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:44,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:36:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:44,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:36:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:36:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-17 02:36:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:36:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-02-17 02:36:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:36:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-17 02:36:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:36:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4131 backedges. 203 proven. 582 refuted. 0 times theorem prover too weak. 3346 trivial. 0 not checked. [2023-02-17 02:36:45,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:36:45,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679669248] [2023-02-17 02:36:45,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679669248] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:36:45,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435653972] [2023-02-17 02:36:45,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:45,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:45,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:36:45,508 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:36:45,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 02:36:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:45,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 02:36:45,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:36:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4131 backedges. 113 proven. 823 refuted. 0 times theorem prover too weak. 3195 trivial. 0 not checked. [2023-02-17 02:36:45,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:36:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4131 backedges. 113 proven. 847 refuted. 0 times theorem prover too weak. 3171 trivial. 0 not checked. [2023-02-17 02:36:45,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435653972] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:36:45,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:36:45,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 28 [2023-02-17 02:36:45,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602474820] [2023-02-17 02:36:45,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:36:45,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-17 02:36:45,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:36:45,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-17 02:36:45,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2023-02-17 02:36:45,972 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 28 states, 26 states have (on average 3.5) internal successors, (91), 28 states have internal predecessors, (91), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) [2023-02-17 02:36:46,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:36:46,437 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2023-02-17 02:36:46,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-17 02:36:46,438 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.5) internal successors, (91), 28 states have internal predecessors, (91), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) Word has length 381 [2023-02-17 02:36:46,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:36:46,440 INFO L225 Difference]: With dead ends: 260 [2023-02-17 02:36:46,440 INFO L226 Difference]: Without dead ends: 155 [2023-02-17 02:36:46,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 842 SyntacticMatches, 16 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=342, Invalid=1638, Unknown=0, NotChecked=0, Total=1980 [2023-02-17 02:36:46,441 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 97 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:36:46,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 259 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:36:46,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-17 02:36:46,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2023-02-17 02:36:46,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 99 states have internal predecessors, (125), 26 states have call successors, (26), 18 states have call predecessors, (26), 17 states have return successors, (73), 27 states have call predecessors, (73), 26 states have call successors, (73) [2023-02-17 02:36:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2023-02-17 02:36:46,450 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 381 [2023-02-17 02:36:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:36:46,451 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2023-02-17 02:36:46,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.5) internal successors, (91), 28 states have internal predecessors, (91), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) [2023-02-17 02:36:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2023-02-17 02:36:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2023-02-17 02:36:46,454 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:36:46,455 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 27, 27, 24, 23, 16, 16, 16, 16, 16, 16, 16, 13, 13, 13, 13, 13, 13, 13, 11, 8, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:36:46,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 02:36:46,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-17 02:36:46,661 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:36:46,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:36:46,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1938766977, now seen corresponding path program 2 times [2023-02-17 02:36:46,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:36:46,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124543474] [2023-02-17 02:36:46,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:46,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:36:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:46,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:36:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:36:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-02-17 02:36:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-02-17 02:36:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:36:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2023-02-17 02:36:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:36:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 02:36:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4709 backedges. 264 proven. 658 refuted. 0 times theorem prover too weak. 3787 trivial. 0 not checked. [2023-02-17 02:36:47,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:36:47,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124543474] [2023-02-17 02:36:47,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124543474] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:36:47,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118440563] [2023-02-17 02:36:47,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:36:47,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:47,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:36:47,682 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:36:47,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-17 02:36:47,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:36:47,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:36:47,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 02:36:47,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:36:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4709 backedges. 158 proven. 973 refuted. 0 times theorem prover too weak. 3578 trivial. 0 not checked. [2023-02-17 02:36:47,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:36:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4709 backedges. 158 proven. 1006 refuted. 0 times theorem prover too weak. 3545 trivial. 0 not checked. [2023-02-17 02:36:48,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118440563] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:36:48,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:36:48,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 19] total 30 [2023-02-17 02:36:48,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407264152] [2023-02-17 02:36:48,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:36:48,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-17 02:36:48,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:36:48,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-17 02:36:48,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2023-02-17 02:36:48,200 INFO L87 Difference]: Start difference. First operand 145 states and 224 transitions. Second operand has 30 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 30 states have internal predecessors, (97), 24 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (40), 15 states have call predecessors, (40), 24 states have call successors, (40) [2023-02-17 02:36:48,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:36:48,780 INFO L93 Difference]: Finished difference Result 334 states and 594 transitions. [2023-02-17 02:36:48,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-17 02:36:48,781 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 30 states have internal predecessors, (97), 24 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (40), 15 states have call predecessors, (40), 24 states have call successors, (40) Word has length 405 [2023-02-17 02:36:48,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:36:48,783 INFO L225 Difference]: With dead ends: 334 [2023-02-17 02:36:48,783 INFO L226 Difference]: Without dead ends: 197 [2023-02-17 02:36:48,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 961 GetRequests, 895 SyntacticMatches, 18 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=2044, Unknown=0, NotChecked=0, Total=2450 [2023-02-17 02:36:48,787 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 114 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:36:48,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 246 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 02:36:48,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-17 02:36:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 173. [2023-02-17 02:36:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 118 states have internal predecessors, (148), 32 states have call successors, (32), 24 states have call predecessors, (32), 18 states have return successors, (92), 30 states have call predecessors, (92), 32 states have call successors, (92) [2023-02-17 02:36:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 272 transitions. [2023-02-17 02:36:48,800 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 272 transitions. Word has length 405 [2023-02-17 02:36:48,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:36:48,801 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 272 transitions. [2023-02-17 02:36:48,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 30 states have internal predecessors, (97), 24 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (40), 15 states have call predecessors, (40), 24 states have call successors, (40) [2023-02-17 02:36:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 272 transitions. [2023-02-17 02:36:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2023-02-17 02:36:48,809 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:36:48,809 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 42, 42, 35, 34, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 14, 13, 9, 7, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:36:48,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 02:36:49,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:49,016 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:36:49,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:36:49,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1326045706, now seen corresponding path program 3 times [2023-02-17 02:36:49,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:36:49,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376947306] [2023-02-17 02:36:49,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:49,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:36:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:49,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:36:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:49,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:36:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 02:36:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-02-17 02:36:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:36:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-02-17 02:36:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:36:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 02:36:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2023-02-17 02:36:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:36:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 02:36:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9892 backedges. 1598 proven. 1117 refuted. 0 times theorem prover too weak. 7177 trivial. 0 not checked. [2023-02-17 02:36:50,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:36:50,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376947306] [2023-02-17 02:36:50,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376947306] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:36:50,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094715933] [2023-02-17 02:36:50,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 02:36:50,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:50,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:36:50,842 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:36:50,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-17 02:36:51,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-17 02:36:51,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:36:51,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 02:36:51,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:36:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9892 backedges. 1559 proven. 84 refuted. 0 times theorem prover too weak. 8249 trivial. 0 not checked. [2023-02-17 02:36:51,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:36:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9892 backedges. 1559 proven. 89 refuted. 0 times theorem prover too weak. 8244 trivial. 0 not checked. [2023-02-17 02:36:51,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094715933] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:36:51,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:36:51,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 14, 17] total 41 [2023-02-17 02:36:51,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430634420] [2023-02-17 02:36:51,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:36:51,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-17 02:36:51,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:36:51,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-17 02:36:51,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1395, Unknown=0, NotChecked=0, Total=1640 [2023-02-17 02:36:51,400 INFO L87 Difference]: Start difference. First operand 173 states and 272 transitions. Second operand has 41 states, 41 states have (on average 2.8292682926829267) internal successors, (116), 41 states have internal predecessors, (116), 26 states have call successors, (38), 1 states have call predecessors, (38), 17 states have return successors, (49), 31 states have call predecessors, (49), 26 states have call successors, (49) [2023-02-17 02:36:51,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:36:51,977 INFO L93 Difference]: Finished difference Result 391 states and 703 transitions. [2023-02-17 02:36:51,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-17 02:36:51,978 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.8292682926829267) internal successors, (116), 41 states have internal predecessors, (116), 26 states have call successors, (38), 1 states have call predecessors, (38), 17 states have return successors, (49), 31 states have call predecessors, (49), 26 states have call successors, (49) Word has length 583 [2023-02-17 02:36:51,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:36:51,979 INFO L225 Difference]: With dead ends: 391 [2023-02-17 02:36:51,979 INFO L226 Difference]: Without dead ends: 220 [2023-02-17 02:36:51,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1373 GetRequests, 1303 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=414, Invalid=2238, Unknown=0, NotChecked=0, Total=2652 [2023-02-17 02:36:51,982 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 76 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:36:51,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 465 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 02:36:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-02-17 02:36:51,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2023-02-17 02:36:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 155 states have (on average 1.0516129032258064) internal successors, (163), 149 states have internal predecessors, (163), 42 states have call successors, (42), 35 states have call predecessors, (42), 18 states have return successors, (109), 31 states have call predecessors, (109), 42 states have call successors, (109) [2023-02-17 02:36:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 314 transitions. [2023-02-17 02:36:51,991 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 314 transitions. Word has length 583 [2023-02-17 02:36:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:36:51,992 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 314 transitions. [2023-02-17 02:36:51,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.8292682926829267) internal successors, (116), 41 states have internal predecessors, (116), 26 states have call successors, (38), 1 states have call predecessors, (38), 17 states have return successors, (49), 31 states have call predecessors, (49), 26 states have call successors, (49) [2023-02-17 02:36:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 314 transitions. [2023-02-17 02:36:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 978 [2023-02-17 02:36:52,005 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:36:52,006 INFO L195 NwaCegarLoop]: trace histogram [74, 74, 69, 69, 58, 57, 37, 37, 37, 37, 37, 37, 37, 34, 34, 34, 34, 34, 34, 34, 24, 20, 16, 12, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:36:52,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-17 02:36:52,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-17 02:36:52,211 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:36:52,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:36:52,211 INFO L85 PathProgramCache]: Analyzing trace with hash -985382679, now seen corresponding path program 4 times [2023-02-17 02:36:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:36:52,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600083708] [2023-02-17 02:36:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:52,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:36:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:53,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:36:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:53,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:53,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:53,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:36:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 02:36:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-17 02:36:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-02-17 02:36:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:36:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 02:36:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-17 02:36:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2023-02-17 02:36:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:36:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 02:36:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-17 02:36:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-02-17 02:36:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:36:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 02:36:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-17 02:36:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:36:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:36:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:36:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:36:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 28345 backedges. 691 proven. 2972 refuted. 0 times theorem prover too weak. 24682 trivial. 0 not checked. [2023-02-17 02:36:54,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:36:54,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600083708] [2023-02-17 02:36:54,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600083708] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:36:54,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102736926] [2023-02-17 02:36:54,712 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 02:36:54,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:36:54,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:36:54,721 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:36:54,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-17 02:36:55,031 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 02:36:55,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:36:55,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 1738 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 02:36:55,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:36:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 28345 backedges. 365 proven. 2987 refuted. 0 times theorem prover too weak. 24993 trivial. 0 not checked. [2023-02-17 02:36:55,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:36:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 28345 backedges. 365 proven. 3031 refuted. 0 times theorem prover too weak. 24949 trivial. 0 not checked. [2023-02-17 02:36:55,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102736926] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:36:55,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:36:55,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 21] total 37 [2023-02-17 02:36:55,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648650049] [2023-02-17 02:36:55,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:36:55,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-17 02:36:55,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:36:55,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-17 02:36:55,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2023-02-17 02:36:55,487 INFO L87 Difference]: Start difference. First operand 216 states and 314 transitions. Second operand has 37 states, 36 states have (on average 3.111111111111111) internal successors, (112), 37 states have internal predecessors, (112), 30 states have call successors, (37), 1 states have call predecessors, (37), 15 states have return successors, (50), 22 states have call predecessors, (50), 30 states have call successors, (50) [2023-02-17 02:36:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:36:56,148 INFO L93 Difference]: Finished difference Result 509 states and 830 transitions. [2023-02-17 02:36:56,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-17 02:36:56,148 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.111111111111111) internal successors, (112), 37 states have internal predecessors, (112), 30 states have call successors, (37), 1 states have call predecessors, (37), 15 states have return successors, (50), 22 states have call predecessors, (50), 30 states have call successors, (50) Word has length 977 [2023-02-17 02:36:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:36:56,151 INFO L225 Difference]: With dead ends: 509 [2023-02-17 02:36:56,151 INFO L226 Difference]: Without dead ends: 284 [2023-02-17 02:36:56,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2284 GetRequests, 2202 SyntacticMatches, 22 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=586, Invalid=3196, Unknown=0, NotChecked=0, Total=3782 [2023-02-17 02:36:56,153 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 132 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:36:56,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 333 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 02:36:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-02-17 02:36:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 252. [2023-02-17 02:36:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 179 states have (on average 1.0502793296089385) internal successors, (188), 175 states have internal predecessors, (188), 52 states have call successors, (52), 41 states have call predecessors, (52), 20 states have return successors, (141), 35 states have call predecessors, (141), 52 states have call successors, (141) [2023-02-17 02:36:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 381 transitions. [2023-02-17 02:36:56,169 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 381 transitions. Word has length 977 [2023-02-17 02:36:56,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:36:56,169 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 381 transitions. [2023-02-17 02:36:56,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.111111111111111) internal successors, (112), 37 states have internal predecessors, (112), 30 states have call successors, (37), 1 states have call predecessors, (37), 15 states have return successors, (50), 22 states have call predecessors, (50), 30 states have call successors, (50) [2023-02-17 02:36:56,170 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 381 transitions. [2023-02-17 02:36:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1605 [2023-02-17 02:36:56,216 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:36:56,217 INFO L195 NwaCegarLoop]: trace histogram [118, 118, 117, 117, 96, 94, 59, 59, 59, 59, 59, 59, 59, 58, 58, 58, 58, 58, 58, 58, 37, 36, 24, 21, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:36:56,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-17 02:36:56,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-17 02:36:56,423 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:36:56,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:36:56,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1122889305, now seen corresponding path program 5 times [2023-02-17 02:36:56,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:36:56,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899035246] [2023-02-17 02:36:56,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:36:56,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:36:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:36:58,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 02:36:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:00,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:00,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:37:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 02:37:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-17 02:37:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:37:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-17 02:37:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:37:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 02:37:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2023-02-17 02:37:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:37:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 02:37:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-17 02:37:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:37:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:01,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2023-02-17 02:37:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:37:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 02:37:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:02,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-17 02:37:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:37:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-17 02:37:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:37:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2023-02-17 02:37:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:37:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 02:37:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 568 [2023-02-17 02:37:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:37:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 02:37:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-17 02:37:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 02:37:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 02:37:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:37:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 02:37:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 02:37:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:37:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 77143 backedges. 3536 proven. 7400 refuted. 0 times theorem prover too weak. 66207 trivial. 0 not checked. [2023-02-17 02:37:03,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:37:03,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899035246] [2023-02-17 02:37:03,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899035246] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:37:03,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707326636] [2023-02-17 02:37:03,279 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 02:37:03,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:37:03,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:37:03,280 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 02:37:03,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-17 02:37:03,803 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) [2023-02-17 02:37:03,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:37:03,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 2286 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-17 02:37:03,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:37:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 77143 backedges. 35563 proven. 775 refuted. 0 times theorem prover too weak. 40805 trivial. 0 not checked. [2023-02-17 02:37:04,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:37:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 77143 backedges. 4786 proven. 2775 refuted. 0 times theorem prover too weak. 69582 trivial. 0 not checked. [2023-02-17 02:37:04,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707326636] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:37:04,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:37:04,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 17, 23] total 62 [2023-02-17 02:37:04,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954553814] [2023-02-17 02:37:04,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:37:04,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-02-17 02:37:04,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:37:04,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-02-17 02:37:04,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=3324, Unknown=0, NotChecked=0, Total=3782 [2023-02-17 02:37:04,638 INFO L87 Difference]: Start difference. First operand 252 states and 381 transitions. Second operand has 62 states, 61 states have (on average 2.7704918032786887) internal successors, (169), 62 states have internal predecessors, (169), 40 states have call successors, (55), 2 states have call predecessors, (55), 28 states have return successors, (77), 48 states have call predecessors, (77), 40 states have call successors, (77) [2023-02-17 02:37:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:37:06,996 INFO L93 Difference]: Finished difference Result 629 states and 1118 transitions. [2023-02-17 02:37:06,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-02-17 02:37:06,997 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.7704918032786887) internal successors, (169), 62 states have internal predecessors, (169), 40 states have call successors, (55), 2 states have call predecessors, (55), 28 states have return successors, (77), 48 states have call predecessors, (77), 40 states have call successors, (77) Word has length 1604 [2023-02-17 02:37:07,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:37:07,004 INFO L225 Difference]: With dead ends: 629 [2023-02-17 02:37:07,005 INFO L226 Difference]: Without dead ends: 374 [2023-02-17 02:37:07,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3776 GetRequests, 3631 SyntacticMatches, 22 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5973 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1736, Invalid=13764, Unknown=0, NotChecked=0, Total=15500 [2023-02-17 02:37:07,011 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 376 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 4201 mSolverCounterSat, 609 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 4810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 609 IncrementalHoareTripleChecker+Valid, 4201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-17 02:37:07,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1158 Invalid, 4810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [609 Valid, 4201 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-17 02:37:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-02-17 02:37:07,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 283. [2023-02-17 02:37:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 201 states have (on average 1.0248756218905473) internal successors, (206), 197 states have internal predecessors, (206), 59 states have call successors, (59), 46 states have call predecessors, (59), 22 states have return successors, (132), 39 states have call predecessors, (132), 59 states have call successors, (132) [2023-02-17 02:37:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 397 transitions. [2023-02-17 02:37:07,029 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 397 transitions. Word has length 1604 [2023-02-17 02:37:07,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:37:07,030 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 397 transitions. [2023-02-17 02:37:07,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.7704918032786887) internal successors, (169), 62 states have internal predecessors, (169), 40 states have call successors, (55), 2 states have call predecessors, (55), 28 states have return successors, (77), 48 states have call predecessors, (77), 40 states have call successors, (77) [2023-02-17 02:37:07,030 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 397 transitions. [2023-02-17 02:37:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2023-02-17 02:37:07,038 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:37:07,038 INFO L195 NwaCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:37:07,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-17 02:37:07,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-17 02:37:07,246 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:37:07,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:37:07,247 INFO L85 PathProgramCache]: Analyzing trace with hash -553145382, now seen corresponding path program 6 times [2023-02-17 02:37:07,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:37:07,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858834434] [2023-02-17 02:37:07,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:37:07,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:37:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 02:37:07,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 02:37:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 02:37:07,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 02:37:07,697 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 02:37:07,698 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 02:37:07,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-17 02:37:07,703 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:37:07,706 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 02:37:07,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 02:37:07 BoogieIcfgContainer [2023-02-17 02:37:07,863 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 02:37:07,864 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 02:37:07,864 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 02:37:07,864 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 02:37:07,864 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:36:37" (3/4) ... [2023-02-17 02:37:07,865 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 02:37:07,974 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 02:37:07,974 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 02:37:07,975 INFO L158 Benchmark]: Toolchain (without parser) took 30696.58ms. Allocated memory was 134.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 91.2MB in the beginning and 622.5MB in the end (delta: -531.3MB). Peak memory consumption was 766.5MB. Max. memory is 16.1GB. [2023-02-17 02:37:07,975 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:37:07,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.07ms. Allocated memory is still 134.2MB. Free memory was 90.9MB in the beginning and 105.4MB in the end (delta: -14.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:37:07,976 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.61ms. Allocated memory is still 134.2MB. Free memory was 105.4MB in the beginning and 103.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:37:07,976 INFO L158 Benchmark]: Boogie Preprocessor took 42.66ms. Allocated memory is still 134.2MB. Free memory was 103.8MB in the beginning and 102.9MB in the end (delta: 973.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:37:07,976 INFO L158 Benchmark]: RCFGBuilder took 276.68ms. Allocated memory is still 134.2MB. Free memory was 102.9MB in the beginning and 92.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:37:07,976 INFO L158 Benchmark]: TraceAbstraction took 29921.13ms. Allocated memory was 134.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 92.4MB in the beginning and 647.7MB in the end (delta: -555.2MB). Peak memory consumption was 744.8MB. Max. memory is 16.1GB. [2023-02-17 02:37:07,977 INFO L158 Benchmark]: Witness Printer took 110.58ms. Allocated memory is still 1.4GB. Free memory was 647.7MB in the beginning and 622.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-02-17 02:37:07,980 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.07ms. Allocated memory is still 134.2MB. Free memory was 90.9MB in the beginning and 105.4MB in the end (delta: -14.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.61ms. Allocated memory is still 134.2MB. Free memory was 105.4MB in the beginning and 103.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.66ms. Allocated memory is still 134.2MB. Free memory was 103.8MB in the beginning and 102.9MB in the end (delta: 973.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 276.68ms. Allocated memory is still 134.2MB. Free memory was 102.9MB in the beginning and 92.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 29921.13ms. Allocated memory was 134.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 92.4MB in the beginning and 647.7MB in the end (delta: -555.2MB). Peak memory consumption was 744.8MB. Max. memory is 16.1GB. * Witness Printer took 110.58ms. Allocated memory is still 1.4GB. Free memory was 647.7MB in the beginning and 622.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 10; VAL [x=10] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L10] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L12] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L20] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L22] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L20] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L22] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L39] int result = fibo1(x); [L40] COND TRUE result == 55 VAL [result=55, x=10] [L41] reach_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.7s, OverallIterations: 15, TraceHistogramMax: 118, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1251 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1180 mSDsluCounter, 3863 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3381 mSDsCounter, 1848 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10600 IncrementalHoareTripleChecker+Invalid, 12448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1848 mSolverCounterUnsat, 482 mSDtfsCounter, 10600 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10373 GetRequests, 9719 SyntacticMatches, 153 SemanticMatches, 501 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10616 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=14, InterpolantAutomatonStates: 362, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 270 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 9954 NumberOfCodeBlocks, 8812 NumberOfCodeBlocksAsserted, 99 NumberOfCheckSat, 13069 ConstructedInterpolants, 0 QuantifiedInterpolants, 18432 SizeOfPredicates, 80 NumberOfNonLiveVariables, 7278 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 348090/375174 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-17 02:37:08,027 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