./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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_10-1.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 acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 18:02:09,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:02:09,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:02:09,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:02:09,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:02:09,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:02:09,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:02:09,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:02:09,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:02:09,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:02:09,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:02:09,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:02:09,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:02:09,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:02:09,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:02:09,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:02:09,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:02:09,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:02:09,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:02:09,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:02:09,221 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:02:09,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:02:09,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:02:09,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:02:09,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:02:09,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:02:09,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:02:09,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:02:09,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:02:09,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:02:09,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:02:09,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:02:09,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:02:09,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:02:09,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:02:09,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:02:09,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:02:09,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:02:09,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:02:09,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:02:09,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:02:09,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:02:09,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 18:02:09,272 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:02:09,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:02:09,273 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:02:09,273 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:02:09,274 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:02:09,274 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:02:09,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:02:09,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:02:09,275 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:02:09,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:02:09,276 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:02:09,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:02:09,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:02:09,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:02:09,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:02:09,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:02:09,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:02:09,277 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:02:09,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:02:09,277 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:02:09,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:02:09,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:02:09,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:02:09,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:02:09,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:02:09,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:02:09,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:02:09,279 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:02:09,279 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:02:09,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:02:09,280 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:02:09,280 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:02:09,280 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:02:09,280 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 [2022-07-13 18:02:09,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:02:09,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:02:09,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:02:09,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:02:09,518 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:02:09,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2022-07-13 18:02:09,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe4c36d79/1cc9d53da71e42d59650c45c44275e8f/FLAGf1fa8ef45 [2022-07-13 18:02:10,021 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:02:10,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2022-07-13 18:02:10,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe4c36d79/1cc9d53da71e42d59650c45c44275e8f/FLAGf1fa8ef45 [2022-07-13 18:02:10,439 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe4c36d79/1cc9d53da71e42d59650c45c44275e8f [2022-07-13 18:02:10,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:02:10,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:02:10,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:02:10,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:02:10,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:02:10,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:02:10" (1/1) ... [2022-07-13 18:02:10,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b50e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:02:10, skipping insertion in model container [2022-07-13 18:02:10,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:02:10" (1/1) ... [2022-07-13 18:02:10,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:02:10,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:02:10,598 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2022-07-13 18:02:10,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:02:10,612 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:02:10,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2022-07-13 18:02:10,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:02:10,649 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:02:10,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:02:10 WrapperNode [2022-07-13 18:02:10,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:02:10,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:02:10,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:02:10,653 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:02:10,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:02:10" (1/1) ... [2022-07-13 18:02:10,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:02:10" (1/1) ... [2022-07-13 18:02:10,680 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-07-13 18:02:10,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:02:10,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:02:10,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:02:10,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:02:10,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:02:10" (1/1) ... [2022-07-13 18:02:10,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:02:10" (1/1) ... [2022-07-13 18:02:10,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:02:10" (1/1) ... [2022-07-13 18:02:10,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:02:10" (1/1) ... [2022-07-13 18:02:10,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:02:10" (1/1) ... [2022-07-13 18:02:10,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:02:10" (1/1) ... [2022-07-13 18:02:10,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:02:10" (1/1) ... [2022-07-13 18:02:10,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:02:10,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:02:10,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:02:10,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:02:10,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:02:10" (1/1) ... [2022-07-13 18:02:10,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:02:10,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:02:10,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 18:02:10,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 18:02:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:02:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:02:10,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:02:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:02:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2022-07-13 18:02:10,786 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2022-07-13 18:02:10,845 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:02:10,847 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:02:10,924 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:02:10,929 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:02:10,930 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 18:02:10,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:02:10 BoogieIcfgContainer [2022-07-13 18:02:10,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:02:10,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:02:10,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:02:10,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:02:10,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:02:10" (1/3) ... [2022-07-13 18:02:10,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7711dbe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:02:10, skipping insertion in model container [2022-07-13 18:02:10,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:02:10" (2/3) ... [2022-07-13 18:02:10,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7711dbe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:02:10, skipping insertion in model container [2022-07-13 18:02:10,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:02:10" (3/3) ... [2022-07-13 18:02:10,939 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2022-07-13 18:02:10,951 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:02:10,952 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:02:11,005 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:02:11,011 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b6d3891, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c1b788b [2022-07-13 18:02:11,011 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:02:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 18:02:11,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 18:02:11,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:02:11,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:02:11,023 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:02:11,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:02:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2022-07-13 18:02:11,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:02:11,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223897915] [2022-07-13 18:02:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:02:11,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:02:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:11,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:02:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:02:11,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:02:11,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223897915] [2022-07-13 18:02:11,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223897915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:02:11,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:02:11,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:02:11,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099043297] [2022-07-13 18:02:11,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:02:11,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:02:11,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:02:11,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:02:11,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:02:11,372 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 18:02:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:02:11,452 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-07-13 18:02:11,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:02:11,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-07-13 18:02:11,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:02:11,463 INFO L225 Difference]: With dead ends: 34 [2022-07-13 18:02:11,464 INFO L226 Difference]: Without dead ends: 18 [2022-07-13 18:02:11,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:02:11,469 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:02:11,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:02:11,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-13 18:02:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-13 18:02:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 18:02:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-13 18:02:11,515 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-07-13 18:02:11,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:02:11,516 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-13 18:02:11,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 18:02:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-07-13 18:02:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 18:02:11,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:02:11,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:02:11,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:02:11,521 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:02:11,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:02:11,522 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2022-07-13 18:02:11,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:02:11,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637279508] [2022-07-13 18:02:11,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:02:11,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:02:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:11,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:02:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:02:11,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:02:11,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637279508] [2022-07-13 18:02:11,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637279508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:02:11,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:02:11,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:02:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179415595] [2022-07-13 18:02:11,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:02:11,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:02:11,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:02:11,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:02:11,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:02:11,589 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 18:02:11,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:02:11,611 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-07-13 18:02:11,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:02:11,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-07-13 18:02:11,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:02:11,612 INFO L225 Difference]: With dead ends: 24 [2022-07-13 18:02:11,613 INFO L226 Difference]: Without dead ends: 20 [2022-07-13 18:02:11,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:02:11,614 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:02:11,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:02:11,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-13 18:02:11,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-13 18:02:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-13 18:02:11,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-07-13 18:02:11,621 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-07-13 18:02:11,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:02:11,622 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-07-13 18:02:11,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 18:02:11,622 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-07-13 18:02:11,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 18:02:11,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:02:11,623 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:02:11,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 18:02:11,624 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:02:11,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:02:11,625 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2022-07-13 18:02:11,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:02:11,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314348895] [2022-07-13 18:02:11,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:02:11,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:02:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:11,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:02:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:11,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:11,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 18:02:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 18:02:11,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:02:11,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314348895] [2022-07-13 18:02:11,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314348895] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:02:11,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998407621] [2022-07-13 18:02:11,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:02:11,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:02:11,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:02:11,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:02:11,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 18:02:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:11,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 18:02:11,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:02:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 18:02:11,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:02:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 18:02:12,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998407621] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:02:12,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:02:12,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-07-13 18:02:12,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883825369] [2022-07-13 18:02:12,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:02:12,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 18:02:12,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:02:12,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 18:02:12,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-13 18:02:12,094 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-13 18:02:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:02:12,225 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-07-13 18:02:12,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 18:02:12,226 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2022-07-13 18:02:12,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:02:12,229 INFO L225 Difference]: With dead ends: 35 [2022-07-13 18:02:12,230 INFO L226 Difference]: Without dead ends: 20 [2022-07-13 18:02:12,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-07-13 18:02:12,235 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 41 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:02:12,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 48 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:02:12,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-13 18:02:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 18:02:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 18:02:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-13 18:02:12,249 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2022-07-13 18:02:12,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:02:12,250 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-13 18:02:12,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-13 18:02:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-13 18:02:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 18:02:12,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:02:12,253 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:02:12,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 18:02:12,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:02:12,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:02:12,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:02:12,472 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2022-07-13 18:02:12,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:02:12,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692745582] [2022-07-13 18:02:12,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:02:12,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:02:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:12,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:02:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:12,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:12,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 18:02:12,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:02:12,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692745582] [2022-07-13 18:02:12,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692745582] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:02:12,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358929123] [2022-07-13 18:02:12,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:02:12,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:02:12,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:02:12,578 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:02:12,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 18:02:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:12,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 18:02:12,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:02:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 18:02:12,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:02:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 18:02:12,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358929123] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:02:12,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:02:12,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2022-07-13 18:02:12,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032122553] [2022-07-13 18:02:12,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:02:12,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 18:02:12,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:02:12,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 18:02:12,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:02:12,867 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-13 18:02:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:02:12,934 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-07-13 18:02:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 18:02:12,935 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2022-07-13 18:02:12,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:02:12,936 INFO L225 Difference]: With dead ends: 38 [2022-07-13 18:02:12,936 INFO L226 Difference]: Without dead ends: 34 [2022-07-13 18:02:12,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-13 18:02:12,938 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:02:12,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 62 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:02:12,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-13 18:02:12,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-13 18:02:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-13 18:02:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-07-13 18:02:12,948 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2022-07-13 18:02:12,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:02:12,949 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2022-07-13 18:02:12,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-13 18:02:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-07-13 18:02:12,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 18:02:12,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:02:12,951 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:02:12,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 18:02:13,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 18:02:13,160 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:02:13,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:02:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2022-07-13 18:02:13,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:02:13,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461080046] [2022-07-13 18:02:13,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:02:13,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:02:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:13,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:02:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:13,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:13,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:13,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:13,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 18:02:13,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:02:13,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461080046] [2022-07-13 18:02:13,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461080046] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:02:13,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215279263] [2022-07-13 18:02:13,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 18:02:13,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:02:13,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:02:13,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:02:13,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 18:02:13,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 18:02:13,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:02:13,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 18:02:13,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:02:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 18:02:13,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:02:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 18:02:13,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215279263] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:02:13,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:02:13,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2022-07-13 18:02:13,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690229064] [2022-07-13 18:02:13,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:02:13,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 18:02:13,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:02:13,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 18:02:13,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:02:13,751 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2022-07-13 18:02:13,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:02:13,919 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2022-07-13 18:02:13,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 18:02:13,919 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2022-07-13 18:02:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:02:13,920 INFO L225 Difference]: With dead ends: 69 [2022-07-13 18:02:13,921 INFO L226 Difference]: Without dead ends: 38 [2022-07-13 18:02:13,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2022-07-13 18:02:13,922 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:02:13,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 77 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:02:13,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-13 18:02:13,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-13 18:02:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-13 18:02:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-07-13 18:02:13,929 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2022-07-13 18:02:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:02:13,930 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-07-13 18:02:13,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2022-07-13 18:02:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-07-13 18:02:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 18:02:13,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:02:13,932 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:02:13,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 18:02:14,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:02:14,148 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:02:14,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:02:14,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 3 times [2022-07-13 18:02:14,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:02:14,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424723353] [2022-07-13 18:02:14,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:02:14,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:02:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:14,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:02:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:14,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:14,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:14,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:14,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:14,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:14,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:14,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:14,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-13 18:02:14,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:02:14,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424723353] [2022-07-13 18:02:14,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424723353] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:02:14,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685306620] [2022-07-13 18:02:14,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 18:02:14,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:02:14,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:02:14,360 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:02:14,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 18:02:14,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-13 18:02:14,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:02:14,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 18:02:14,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:02:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 18:02:14,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:02:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 29 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-07-13 18:02:14,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685306620] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:02:14,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:02:14,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 17 [2022-07-13 18:02:14,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827649562] [2022-07-13 18:02:14,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:02:14,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 18:02:14,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:02:14,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 18:02:14,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:02:14,755 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2022-07-13 18:02:14,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:02:14,869 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2022-07-13 18:02:14,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 18:02:14,871 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) Word has length 65 [2022-07-13 18:02:14,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:02:14,877 INFO L225 Difference]: With dead ends: 85 [2022-07-13 18:02:14,877 INFO L226 Difference]: Without dead ends: 50 [2022-07-13 18:02:14,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2022-07-13 18:02:14,883 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:02:14,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 67 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:02:14,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-13 18:02:14,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-07-13 18:02:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2022-07-13 18:02:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-07-13 18:02:14,892 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 65 [2022-07-13 18:02:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:02:14,893 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2022-07-13 18:02:14,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2022-07-13 18:02:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-07-13 18:02:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-13 18:02:14,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:02:14,895 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:02:14,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 18:02:15,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:02:15,115 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:02:15,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:02:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1033750100, now seen corresponding path program 4 times [2022-07-13 18:02:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:02:15,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126157073] [2022-07-13 18:02:15,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:02:15,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:02:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:02:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2022-07-13 18:02:15,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:02:15,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126157073] [2022-07-13 18:02:15,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126157073] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:02:15,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167433287] [2022-07-13 18:02:15,455 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 18:02:15,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:02:15,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:02:15,460 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:02:15,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 18:02:15,539 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 18:02:15,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:02:15,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 18:02:15,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:02:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2022-07-13 18:02:15,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:02:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 403 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2022-07-13 18:02:16,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167433287] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:02:16,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:02:16,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 13] total 20 [2022-07-13 18:02:16,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216110058] [2022-07-13 18:02:16,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:02:16,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 18:02:16,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:02:16,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 18:02:16,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2022-07-13 18:02:16,385 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-13 18:02:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:02:16,566 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2022-07-13 18:02:16,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 18:02:16,570 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) Word has length 147 [2022-07-13 18:02:16,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:02:16,577 INFO L225 Difference]: With dead ends: 117 [2022-07-13 18:02:16,577 INFO L226 Difference]: Without dead ends: 113 [2022-07-13 18:02:16,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2022-07-13 18:02:16,579 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 132 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:02:16,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 70 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:02:16,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-13 18:02:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2022-07-13 18:02:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 68 states have internal predecessors, (82), 21 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (56), 26 states have call predecessors, (56), 21 states have call successors, (56) [2022-07-13 18:02:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2022-07-13 18:02:16,601 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 147 [2022-07-13 18:02:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:02:16,602 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2022-07-13 18:02:16,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-13 18:02:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2022-07-13 18:02:16,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-13 18:02:16,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:02:16,612 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:02:16,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 18:02:16,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:02:16,830 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:02:16,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:02:16,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 5 times [2022-07-13 18:02:16,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:02:16,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694827206] [2022-07-13 18:02:16,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:02:16,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:02:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:16,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:02:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:16,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:02:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 403 proven. 706 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2022-07-13 18:02:17,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:02:17,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694827206] [2022-07-13 18:02:17,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694827206] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:02:17,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125858266] [2022-07-13 18:02:17,335 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 18:02:17,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:02:17,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:02:17,340 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) [2022-07-13 18:02:17,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 18:02:17,441 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-07-13 18:02:17,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:02:17,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 18:02:17,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:02:17,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 571 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2022-07-13 18:02:17,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:02:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 632 proven. 605 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2022-07-13 18:02:19,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125858266] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:02:19,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:02:19,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 21] total 34 [2022-07-13 18:02:19,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631869300] [2022-07-13 18:02:19,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:02:19,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-13 18:02:19,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:02:19,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-13 18:02:19,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2022-07-13 18:02:19,170 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) [2022-07-13 18:02:19,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:02:19,670 INFO L93 Difference]: Finished difference Result 193 states and 365 transitions. [2022-07-13 18:02:19,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 18:02:19,672 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) Word has length 215 [2022-07-13 18:02:19,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:02:19,674 INFO L225 Difference]: With dead ends: 193 [2022-07-13 18:02:19,674 INFO L226 Difference]: Without dead ends: 95 [2022-07-13 18:02:19,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 473 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=650, Invalid=2002, Unknown=0, NotChecked=0, Total=2652 [2022-07-13 18:02:19,676 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 203 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:02:19,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 172 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:02:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-13 18:02:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2022-07-13 18:02:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 58 states have internal predecessors, (62), 15 states have call successors, (15), 12 states have call predecessors, (15), 8 states have return successors, (36), 13 states have call predecessors, (36), 15 states have call successors, (36) [2022-07-13 18:02:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2022-07-13 18:02:19,697 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 215 [2022-07-13 18:02:19,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:02:19,700 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2022-07-13 18:02:19,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.757575757575758) internal successors, (91), 34 states have internal predecessors, (91), 24 states have call successors, (31), 1 states have call predecessors, (31), 13 states have return successors, (42), 21 states have call predecessors, (42), 24 states have call successors, (42) [2022-07-13 18:02:19,700 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2022-07-13 18:02:19,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-07-13 18:02:19,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:02:19,706 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:02:19,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 18:02:19,931 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 [2022-07-13 18:02:19,932 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:02:19,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:02:19,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1099173212, now seen corresponding path program 6 times [2022-07-13 18:02:19,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:02:19,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042514063] [2022-07-13 18:02:19,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:02:19,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:02:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:02:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:02:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 18:02:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2022-07-13 18:02:20,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:02:20,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042514063] [2022-07-13 18:02:20,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042514063] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:02:20,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173590688] [2022-07-13 18:02:20,447 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 18:02:20,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:02:20,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:02:20,452 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) [2022-07-13 18:02:20,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 18:02:20,568 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2022-07-13 18:02:20,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:02:20,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 18:02:20,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:02:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 331 proven. 821 refuted. 0 times theorem prover too weak. 3416 trivial. 0 not checked. [2022-07-13 18:02:20,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:02:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 335 proven. 857 refuted. 0 times theorem prover too weak. 3376 trivial. 0 not checked. [2022-07-13 18:02:21,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173590688] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:02:21,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:02:21,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 15] total 25 [2022-07-13 18:02:21,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930190611] [2022-07-13 18:02:21,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:02:21,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 18:02:21,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:02:21,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 18:02:21,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2022-07-13 18:02:21,862 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 25 states have internal predecessors, (65), 20 states have call successors, (23), 1 states have call predecessors, (23), 8 states have return successors, (32), 16 states have call predecessors, (32), 20 states have call successors, (32) [2022-07-13 18:02:22,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:02:22,072 INFO L93 Difference]: Finished difference Result 266 states and 398 transitions. [2022-07-13 18:02:22,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 18:02:22,073 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 25 states have internal predecessors, (65), 20 states have call successors, (23), 1 states have call predecessors, (23), 8 states have return successors, (32), 16 states have call predecessors, (32), 20 states have call successors, (32) Word has length 283 [2022-07-13 18:02:22,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:02:22,077 INFO L225 Difference]: With dead ends: 266 [2022-07-13 18:02:22,077 INFO L226 Difference]: Without dead ends: 262 [2022-07-13 18:02:22,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=213, Invalid=437, Unknown=0, NotChecked=0, Total=650 [2022-07-13 18:02:22,078 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 170 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:02:22,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 102 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:02:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-13 18:02:22,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 247. [2022-07-13 18:02:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 170 states have (on average 1.035294117647059) internal successors, (176), 165 states have internal predecessors, (176), 52 states have call successors, (52), 31 states have call predecessors, (52), 24 states have return successors, (140), 50 states have call predecessors, (140), 52 states have call successors, (140) [2022-07-13 18:02:22,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 368 transitions. [2022-07-13 18:02:22,104 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 368 transitions. Word has length 283 [2022-07-13 18:02:22,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:02:22,104 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 368 transitions. [2022-07-13 18:02:22,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 25 states have internal predecessors, (65), 20 states have call successors, (23), 1 states have call predecessors, (23), 8 states have return successors, (32), 16 states have call predecessors, (32), 20 states have call successors, (32) [2022-07-13 18:02:22,105 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 368 transitions. [2022-07-13 18:02:22,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2022-07-13 18:02:22,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:02:22,113 INFO L195 NwaCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:02:22,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 18:02:22,339 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 [2022-07-13 18:02:22,339 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:02:22,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:02:22,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1042599522, now seen corresponding path program 7 times [2022-07-13 18:02:22,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:02:22,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267690578] [2022-07-13 18:02:22,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:02:22,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:02:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:22,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:02:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:22,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:22,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:22,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:02:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 18:02:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-13 18:02:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:02:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 18:02:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2022-07-13 18:02:23,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:02:23,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267690578] [2022-07-13 18:02:23,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267690578] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:02:23,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670562562] [2022-07-13 18:02:23,576 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-13 18:02:23,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:02:23,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:02:23,578 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) [2022-07-13 18:02:23,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 18:02:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:23,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 18:02:23,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:02:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 386 proven. 2689 refuted. 0 times theorem prover too weak. 13332 trivial. 0 not checked. [2022-07-13 18:02:23,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:02:26,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 386 proven. 2766 refuted. 0 times theorem prover too weak. 13255 trivial. 0 not checked. [2022-07-13 18:02:26,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670562562] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:02:26,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:02:26,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 12, 19] total 38 [2022-07-13 18:02:26,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866307713] [2022-07-13 18:02:26,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:02:26,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-13 18:02:26,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:02:26,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-13 18:02:26,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 18:02:26,437 INFO L87 Difference]: Start difference. First operand 247 states and 368 transitions. Second operand has 38 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 38 states have internal predecessors, (92), 30 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (50), 25 states have call predecessors, (50), 30 states have call successors, (50) [2022-07-13 18:02:27,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:02:27,080 INFO L93 Difference]: Finished difference Result 388 states and 667 transitions. [2022-07-13 18:02:27,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-13 18:02:27,081 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 38 states have internal predecessors, (92), 30 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (50), 25 states have call predecessors, (50), 30 states have call successors, (50) Word has length 528 [2022-07-13 18:02:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:02:27,083 INFO L225 Difference]: With dead ends: 388 [2022-07-13 18:02:27,083 INFO L226 Difference]: Without dead ends: 152 [2022-07-13 18:02:27,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1266 GetRequests, 1207 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=873, Invalid=2787, Unknown=0, NotChecked=0, Total=3660 [2022-07-13 18:02:27,086 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 223 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:02:27,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 227 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:02:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-13 18:02:27,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 122. [2022-07-13 18:02:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 87 states have (on average 1.0344827586206897) internal successors, (90), 85 states have internal predecessors, (90), 24 states have call successors, (24), 19 states have call predecessors, (24), 10 states have return successors, (58), 17 states have call predecessors, (58), 24 states have call successors, (58) [2022-07-13 18:02:27,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2022-07-13 18:02:27,097 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 528 [2022-07-13 18:02:27,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:02:27,098 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2022-07-13 18:02:27,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 38 states have internal predecessors, (92), 30 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (50), 25 states have call predecessors, (50), 30 states have call successors, (50) [2022-07-13 18:02:27,098 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2022-07-13 18:02:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2022-07-13 18:02:27,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:02:27,116 INFO L195 NwaCegarLoop]: trace histogram [125, 125, 101, 62, 62, 62, 62, 62, 62, 62, 39, 24, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:02:27,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 18:02:27,337 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 [2022-07-13 18:02:27,338 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:02:27,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:02:27,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1121911956, now seen corresponding path program 8 times [2022-07-13 18:02:27,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:02:27,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253374002] [2022-07-13 18:02:27,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:02:27,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:02:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:27,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:02:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:02:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 18:02:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-13 18:02:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:02:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-07-13 18:02:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:28,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:02:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 18:02:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-13 18:02:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 5753 proven. 5825 refuted. 0 times theorem prover too weak. 32036 trivial. 0 not checked. [2022-07-13 18:02:29,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:02:29,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253374002] [2022-07-13 18:02:29,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253374002] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:02:29,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479301159] [2022-07-13 18:02:29,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 18:02:29,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:02:29,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:02:29,384 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) [2022-07-13 18:02:29,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 18:02:29,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 18:02:29,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:02:29,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 18:02:29,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:02:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 699 proven. 5145 refuted. 0 times theorem prover too weak. 37770 trivial. 0 not checked. [2022-07-13 18:02:29,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:02:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 699 proven. 5245 refuted. 0 times theorem prover too weak. 37670 trivial. 0 not checked. [2022-07-13 18:02:33,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479301159] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:02:33,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:02:33,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 13, 21] total 42 [2022-07-13 18:02:33,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195330126] [2022-07-13 18:02:33,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:02:33,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-13 18:02:33,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:02:33,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-13 18:02:33,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=1306, Unknown=0, NotChecked=0, Total=1722 [2022-07-13 18:02:33,622 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 42 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 42 states have internal predecessors, (101), 33 states have call successors, (36), 1 states have call predecessors, (36), 16 states have return successors, (56), 29 states have call predecessors, (56), 33 states have call successors, (56) [2022-07-13 18:02:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:02:34,410 INFO L93 Difference]: Finished difference Result 270 states and 462 transitions. [2022-07-13 18:02:34,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-13 18:02:34,416 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 42 states have internal predecessors, (101), 33 states have call successors, (36), 1 states have call predecessors, (36), 16 states have return successors, (56), 29 states have call predecessors, (56), 33 states have call successors, (56) Word has length 855 [2022-07-13 18:02:34,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:02:34,423 INFO L225 Difference]: With dead ends: 270 [2022-07-13 18:02:34,423 INFO L226 Difference]: Without dead ends: 163 [2022-07-13 18:02:34,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2026 GetRequests, 1957 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1113, Invalid=3579, Unknown=0, NotChecked=0, Total=4692 [2022-07-13 18:02:34,426 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 369 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 18:02:34,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 222 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 18:02:34,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-13 18:02:34,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 139. [2022-07-13 18:02:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 97 states have internal predecessors, (102), 28 states have call successors, (28), 22 states have call predecessors, (28), 11 states have return successors, (71), 19 states have call predecessors, (71), 28 states have call successors, (71) [2022-07-13 18:02:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 201 transitions. [2022-07-13 18:02:34,442 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 201 transitions. Word has length 855 [2022-07-13 18:02:34,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:02:34,444 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 201 transitions. [2022-07-13 18:02:34,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 42 states have internal predecessors, (101), 33 states have call successors, (36), 1 states have call predecessors, (36), 16 states have return successors, (56), 29 states have call predecessors, (56), 33 states have call successors, (56) [2022-07-13 18:02:34,445 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2022-07-13 18:02:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1564 [2022-07-13 18:02:34,515 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:02:34,515 INFO L195 NwaCegarLoop]: trace histogram [229, 229, 185, 114, 114, 114, 114, 114, 114, 114, 71, 44, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:02:34,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 18:02:34,739 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 [2022-07-13 18:02:34,740 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:02:34,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:02:34,740 INFO L85 PathProgramCache]: Analyzing trace with hash 35450340, now seen corresponding path program 9 times [2022-07-13 18:02:34,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:02:34,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655872378] [2022-07-13 18:02:34,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:02:34,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:02:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:36,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:02:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:36,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:02:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 18:02:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-13 18:02:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:02:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-07-13 18:02:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:02:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 18:02:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:37,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2022-07-13 18:02:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:02:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 18:02:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-13 18:02:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:02:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-07-13 18:02:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:38,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:02:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 636 [2022-07-13 18:02:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:02:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 18:02:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 18:02:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:02:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:02:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:02:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:02:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 147208 backedges. 13165 proven. 14022 refuted. 0 times theorem prover too weak. 120021 trivial. 0 not checked. [2022-07-13 18:02:39,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:02:39,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655872378] [2022-07-13 18:02:39,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655872378] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:02:39,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944006948] [2022-07-13 18:02:39,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 18:02:39,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:02:39,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:02:39,222 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) [2022-07-13 18:02:39,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 18:02:39,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 108 check-sat command(s) [2022-07-13 18:02:39,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:02:39,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 18:02:39,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:02:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 147208 backedges. 10746 proven. 1070 refuted. 0 times theorem prover too weak. 135392 trivial. 0 not checked. [2022-07-13 18:02:40,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:02:44,643 INFO L134 CoverageAnalysis]: Checked inductivity of 147208 backedges. 10746 proven. 1120 refuted. 0 times theorem prover too weak. 135342 trivial. 0 not checked. [2022-07-13 18:02:44,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944006948] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:02:44,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:02:44,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14, 21] total 48 [2022-07-13 18:02:44,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855875607] [2022-07-13 18:02:44,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:02:44,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-13 18:02:44,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:02:44,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-13 18:02:44,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=1755, Unknown=0, NotChecked=0, Total=2256 [2022-07-13 18:02:44,649 INFO L87 Difference]: Start difference. First operand 139 states and 201 transitions. Second operand has 48 states, 47 states have (on average 2.425531914893617) internal successors, (114), 48 states have internal predecessors, (114), 29 states have call successors, (41), 1 states have call predecessors, (41), 19 states have return successors, (62), 42 states have call predecessors, (62), 29 states have call successors, (62) [2022-07-13 18:02:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:02:45,694 INFO L93 Difference]: Finished difference Result 319 states and 564 transitions. [2022-07-13 18:02:45,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-13 18:02:45,694 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.425531914893617) internal successors, (114), 48 states have internal predecessors, (114), 29 states have call successors, (41), 1 states have call predecessors, (41), 19 states have return successors, (62), 42 states have call predecessors, (62), 29 states have call successors, (62) Word has length 1563 [2022-07-13 18:02:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:02:45,698 INFO L225 Difference]: With dead ends: 319 [2022-07-13 18:02:45,698 INFO L226 Difference]: Without dead ends: 195 [2022-07-13 18:02:45,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3665 GetRequests, 3580 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2140 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1446, Invalid=5360, Unknown=0, NotChecked=0, Total=6806 [2022-07-13 18:02:45,702 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 376 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 624 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 624 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 18:02:45,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 277 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [624 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 18:02:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-13 18:02:45,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2022-07-13 18:02:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 112 states have (on average 1.0267857142857142) internal successors, (115), 110 states have internal predecessors, (115), 33 states have call successors, (33), 26 states have call predecessors, (33), 11 states have return successors, (84), 20 states have call predecessors, (84), 33 states have call successors, (84) [2022-07-13 18:02:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2022-07-13 18:02:45,716 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 1563 [2022-07-13 18:02:45,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:02:45,717 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2022-07-13 18:02:45,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.425531914893617) internal successors, (114), 48 states have internal predecessors, (114), 29 states have call successors, (41), 1 states have call predecessors, (41), 19 states have return successors, (62), 42 states have call predecessors, (62), 29 states have call successors, (62) [2022-07-13 18:02:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2022-07-13 18:02:45,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2022-07-13 18:02:45,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:02:45,733 INFO L195 NwaCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:02:45,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-13 18:02:45,943 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 [2022-07-13 18:02:45,944 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:02:45,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:02:45,944 INFO L85 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 10 times [2022-07-13 18:02:45,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:02:45,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607038768] [2022-07-13 18:02:45,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:02:45,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:02:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:02:46,149 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 18:02:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:02:46,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 18:02:46,610 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 18:02:46,611 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 18:02:46,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 18:02:46,616 INFO L356 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2022-07-13 18:02:46,621 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 18:02:46,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:02:46 BoogieIcfgContainer [2022-07-13 18:02:46,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 18:02:46,797 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 18:02:46,797 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 18:02:46,797 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 18:02:46,797 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:02:10" (3/4) ... [2022-07-13 18:02:46,799 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 18:02:46,935 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 18:02:46,935 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 18:02:46,936 INFO L158 Benchmark]: Toolchain (without parser) took 36493.12ms. Allocated memory was 98.6MB in the beginning and 608.2MB in the end (delta: 509.6MB). Free memory was 67.9MB in the beginning and 499.3MB in the end (delta: -431.3MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. [2022-07-13 18:02:46,936 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 98.6MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:02:46,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.58ms. Allocated memory is still 98.6MB. Free memory was 67.7MB in the beginning and 74.9MB in the end (delta: -7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 18:02:46,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.63ms. Allocated memory is still 98.6MB. Free memory was 74.9MB in the beginning and 73.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:02:46,937 INFO L158 Benchmark]: Boogie Preprocessor took 23.13ms. Allocated memory is still 98.6MB. Free memory was 73.6MB in the beginning and 72.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:02:46,937 INFO L158 Benchmark]: RCFGBuilder took 225.07ms. Allocated memory is still 98.6MB. Free memory was 72.6MB in the beginning and 64.2MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 18:02:46,938 INFO L158 Benchmark]: TraceAbstraction took 35863.12ms. Allocated memory was 98.6MB in the beginning and 608.2MB in the end (delta: 509.6MB). Free memory was 63.5MB in the beginning and 523.4MB in the end (delta: -459.8MB). Peak memory consumption was 361.1MB. Max. memory is 16.1GB. [2022-07-13 18:02:46,938 INFO L158 Benchmark]: Witness Printer took 138.55ms. Allocated memory is still 608.2MB. Free memory was 523.4MB in the beginning and 499.3MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-13 18:02:46,940 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.21ms. Allocated memory is still 98.6MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.58ms. Allocated memory is still 98.6MB. Free memory was 67.7MB in the beginning and 74.9MB in the end (delta: -7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.63ms. Allocated memory is still 98.6MB. Free memory was 74.9MB in the beginning and 73.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.13ms. Allocated memory is still 98.6MB. Free memory was 73.6MB in the beginning and 72.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 225.07ms. Allocated memory is still 98.6MB. Free memory was 72.6MB in the beginning and 64.2MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 35863.12ms. Allocated memory was 98.6MB in the beginning and 608.2MB in the end (delta: 509.6MB). Free memory was 63.5MB in the beginning and 523.4MB in the end (delta: -459.8MB). Peak memory consumption was 361.1MB. Max. memory is 16.1GB. * Witness Printer took 138.55ms. Allocated memory is still 608.2MB. Free memory was 523.4MB in the beginning and 499.3MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 10; VAL [x=10] [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [fibo(x)=55, x=10] [L27] int result = fibo(x); [L28] COND TRUE result == 55 VAL [result=55, x=10] [L29] reach_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.6s, OverallIterations: 13, TraceHistogramMax: 229, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1741 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1671 mSDsluCounter, 1473 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1199 mSDsCounter, 2322 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3174 IncrementalHoareTripleChecker+Invalid, 5496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2322 mSolverCounterUnsat, 274 mSDtfsCounter, 3174 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8889 GetRequests, 8504 SyntacticMatches, 17 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6064 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=9, InterpolantAutomatonStates: 250, 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, 12 MinimizatonAttempts, 132 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 25.6s InterpolantComputationTime, 8710 NumberOfCodeBlocks, 7850 NumberOfCodeBlocksAsserted, 178 NumberOfCheckSat, 11209 ConstructedInterpolants, 0 QuantifiedInterpolants, 15460 SizeOfPredicates, 57 NumberOfNonLiveVariables, 6571 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 600612/647382 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 18:02:46,983 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