./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3dbbec33 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 13:05:40,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 13:05:40,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 13:05:40,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 13:05:40,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 13:05:40,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 13:05:40,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 13:05:40,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 13:05:40,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 13:05:40,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 13:05:40,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 13:05:40,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 13:05:40,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 13:05:40,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 13:05:40,151 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 13:05:40,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 13:05:40,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 13:05:40,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 13:05:40,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 13:05:40,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 13:05:40,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 13:05:40,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 13:05:40,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 13:05:40,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 13:05:40,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 13:05:40,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 13:05:40,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 13:05:40,169 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 13:05:40,169 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 13:05:40,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 13:05:40,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 13:05:40,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 13:05:40,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 13:05:40,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 13:05:40,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 13:05:40,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 13:05:40,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 13:05:40,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 13:05:40,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 13:05:40,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 13:05:40,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 13:05:40,177 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-14 13:05:40,202 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 13:05:40,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 13:05:40,203 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 13:05:40,203 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 13:05:40,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 13:05:40,204 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 13:05:40,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 13:05:40,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 13:05:40,205 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 13:05:40,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 13:05:40,205 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 13:05:40,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 13:05:40,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 13:05:40,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 13:05:40,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 13:05:40,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 13:05:40,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 13:05:40,206 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 13:05:40,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 13:05:40,207 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 13:05:40,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 13:05:40,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 13:05:40,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 13:05:40,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 13:05:40,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:05:40,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 13:05:40,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 13:05:40,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 13:05:40,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 13:05:40,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 13:05:40,208 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 13:05:40,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 13:05:40,209 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 13:05:40,209 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 13:05:40,209 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 13:05:40,209 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db [2023-02-14 13:05:40,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 13:05:40,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 13:05:40,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 13:05:40,401 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 13:05:40,401 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 13:05:40,402 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2023-02-14 13:05:41,295 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 13:05:41,436 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 13:05:41,436 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2023-02-14 13:05:41,441 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84f835f8/be8dc4ecb6bd4c9b86a9991bc00dce4c/FLAG1bf95807d [2023-02-14 13:05:41,451 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84f835f8/be8dc4ecb6bd4c9b86a9991bc00dce4c [2023-02-14 13:05:41,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 13:05:41,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 13:05:41,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 13:05:41,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 13:05:41,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 13:05:41,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:05:41" (1/1) ... [2023-02-14 13:05:41,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf9b8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:05:41, skipping insertion in model container [2023-02-14 13:05:41,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:05:41" (1/1) ... [2023-02-14 13:05:41,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 13:05:41,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 13:05:41,553 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2023-02-14 13:05:41,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:05:41,562 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 13:05:41,571 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2023-02-14 13:05:41,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:05:41,580 INFO L208 MainTranslator]: Completed translation [2023-02-14 13:05:41,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:05:41 WrapperNode [2023-02-14 13:05:41,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 13:05:41,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 13:05:41,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 13:05:41,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 13:05:41,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:05:41" (1/1) ... [2023-02-14 13:05:41,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:05:41" (1/1) ... [2023-02-14 13:05:41,598 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2023-02-14 13:05:41,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 13:05:41,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 13:05:41,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 13:05:41,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 13:05:41,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:05:41" (1/1) ... [2023-02-14 13:05:41,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:05:41" (1/1) ... [2023-02-14 13:05:41,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:05:41" (1/1) ... [2023-02-14 13:05:41,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:05:41" (1/1) ... [2023-02-14 13:05:41,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:05:41" (1/1) ... [2023-02-14 13:05:41,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:05:41" (1/1) ... [2023-02-14 13:05:41,610 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:05:41" (1/1) ... [2023-02-14 13:05:41,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:05:41" (1/1) ... [2023-02-14 13:05:41,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 13:05:41,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 13:05:41,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 13:05:41,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 13:05:41,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:05:41" (1/1) ... [2023-02-14 13:05:41,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:05:41,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:05:41,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 13:05:41,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 13:05:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 13:05:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 13:05:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-02-14 13:05:41,671 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-02-14 13:05:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-02-14 13:05:41,672 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-02-14 13:05:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 13:05:41,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 13:05:41,713 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 13:05:41,714 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 13:05:41,785 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 13:05:41,789 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 13:05:41,790 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-14 13:05:41,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:05:41 BoogieIcfgContainer [2023-02-14 13:05:41,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 13:05:41,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 13:05:41,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 13:05:41,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 13:05:41,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:05:41" (1/3) ... [2023-02-14 13:05:41,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8559f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:05:41, skipping insertion in model container [2023-02-14 13:05:41,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:05:41" (2/3) ... [2023-02-14 13:05:41,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8559f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:05:41, skipping insertion in model container [2023-02-14 13:05:41,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:05:41" (3/3) ... [2023-02-14 13:05:41,797 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2023-02-14 13:05:41,809 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 13:05:41,809 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 13:05:41,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 13:05:41,842 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c4e9d4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 13:05:41,843 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 13:05:41,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 13:05:41,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 13:05:41,850 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:05:41,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:05:41,851 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:05:41,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:05:41,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2023-02-14 13:05:41,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:05:41,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721724563] [2023-02-14 13:05:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:41,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:05:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:42,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:05:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:42,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:05:42,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:05:42,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721724563] [2023-02-14 13:05:42,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721724563] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:05:42,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:05:42,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 13:05:42,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774269666] [2023-02-14 13:05:42,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:05:42,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:05:42,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:05:42,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:05:42,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:05:42,167 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 13:05:42,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:05:42,212 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2023-02-14 13:05:42,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:05:42,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-02-14 13:05:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:05:42,220 INFO L225 Difference]: With dead ends: 43 [2023-02-14 13:05:42,220 INFO L226 Difference]: Without dead ends: 27 [2023-02-14 13:05:42,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:05:42,224 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:05:42,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 123 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:05:42,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-14 13:05:42,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-14 13:05:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-14 13:05:42,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-02-14 13:05:42,249 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2023-02-14 13:05:42,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:05:42,250 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-02-14 13:05:42,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 13:05:42,251 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-02-14 13:05:42,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-14 13:05:42,252 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:05:42,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:05:42,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 13:05:42,252 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:05:42,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:05:42,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2023-02-14 13:05:42,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:05:42,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909943499] [2023-02-14 13:05:42,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:42,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:05:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:42,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:05:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:42,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:05:42,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:05:42,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909943499] [2023-02-14 13:05:42,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909943499] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:05:42,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:05:42,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 13:05:42,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263356924] [2023-02-14 13:05:42,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:05:42,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:05:42,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:05:42,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:05:42,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:05:42,363 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 13:05:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:05:42,393 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2023-02-14 13:05:42,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:05:42,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-02-14 13:05:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:05:42,396 INFO L225 Difference]: With dead ends: 33 [2023-02-14 13:05:42,396 INFO L226 Difference]: Without dead ends: 29 [2023-02-14 13:05:42,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:05:42,401 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:05:42,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:05:42,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-14 13:05:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-02-14 13:05:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-14 13:05:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-02-14 13:05:42,411 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2023-02-14 13:05:42,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:05:42,412 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-02-14 13:05:42,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 13:05:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-02-14 13:05:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-14 13:05:42,414 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:05:42,417 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:05:42,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 13:05:42,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:05:42,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:05:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2023-02-14 13:05:42,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:05:42,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944792562] [2023-02-14 13:05:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:42,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:05:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:42,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:05:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:42,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:42,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-14 13:05:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:05:42,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:05:42,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944792562] [2023-02-14 13:05:42,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944792562] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:05:42,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593971694] [2023-02-14 13:05:42,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:42,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:42,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:05:42,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:05:42,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 13:05:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:42,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 13:05:42,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:05:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:05:42,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:05:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:05:42,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593971694] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:05:42,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:05:42,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2023-02-14 13:05:42,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316440412] [2023-02-14 13:05:42,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:05:42,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 13:05:42,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:05:42,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 13:05:42,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-14 13:05:42,927 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-14 13:05:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:05:43,057 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2023-02-14 13:05:43,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 13:05:43,058 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2023-02-14 13:05:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:05:43,059 INFO L225 Difference]: With dead ends: 55 [2023-02-14 13:05:43,059 INFO L226 Difference]: Without dead ends: 31 [2023-02-14 13:05:43,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2023-02-14 13:05:43,061 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:05:43,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 112 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:05:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-14 13:05:43,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-02-14 13:05:43,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-14 13:05:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-02-14 13:05:43,073 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2023-02-14 13:05:43,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:05:43,073 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-02-14 13:05:43,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-14 13:05:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-02-14 13:05:43,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-14 13:05:43,076 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:05:43,076 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:05:43,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 13:05:43,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:43,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:05:43,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:05:43,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2023-02-14 13:05:43,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:05:43,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537431435] [2023-02-14 13:05:43,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:43,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:05:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:43,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:05:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:43,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:43,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:05:43,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:05:43,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537431435] [2023-02-14 13:05:43,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537431435] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:05:43,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720185325] [2023-02-14 13:05:43,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:43,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:43,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:05:43,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:05:43,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 13:05:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:43,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 13:05:43,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:05:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:05:43,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:05:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 13:05:43,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720185325] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:05:43,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:05:43,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2023-02-14 13:05:43,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833276] [2023-02-14 13:05:43,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:05:43,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 13:05:43,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:05:43,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 13:05:43,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-14 13:05:43,698 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 13:05:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:05:43,843 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2023-02-14 13:05:43,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 13:05:43,844 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2023-02-14 13:05:43,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:05:43,845 INFO L225 Difference]: With dead ends: 51 [2023-02-14 13:05:43,846 INFO L226 Difference]: Without dead ends: 47 [2023-02-14 13:05:43,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-02-14 13:05:43,847 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:05:43,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 92 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:05:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-14 13:05:43,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-02-14 13:05:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2023-02-14 13:05:43,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2023-02-14 13:05:43,853 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2023-02-14 13:05:43,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:05:43,854 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2023-02-14 13:05:43,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 13:05:43,854 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2023-02-14 13:05:43,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 13:05:43,855 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:05:43,855 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:05:43,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-14 13:05:44,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-14 13:05:44,063 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:05:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:05:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2023-02-14 13:05:44,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:05:44,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886283831] [2023-02-14 13:05:44,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:44,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:05:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:44,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:05:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:44,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:44,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:44,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-14 13:05:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:44,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-14 13:05:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 13:05:44,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:05:44,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886283831] [2023-02-14 13:05:44,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886283831] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:05:44,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830382257] [2023-02-14 13:05:44,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:44,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:44,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:05:44,148 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:05:44,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-14 13:05:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:44,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 13:05:44,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:05:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 13:05:44,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:05:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-14 13:05:44,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830382257] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:05:44,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:05:44,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2023-02-14 13:05:44,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492611813] [2023-02-14 13:05:44,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:05:44,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-14 13:05:44,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:05:44,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-14 13:05:44,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-02-14 13:05:44,508 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2023-02-14 13:05:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:05:44,688 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2023-02-14 13:05:44,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 13:05:44,688 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2023-02-14 13:05:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:05:44,689 INFO L225 Difference]: With dead ends: 105 [2023-02-14 13:05:44,689 INFO L226 Difference]: Without dead ends: 63 [2023-02-14 13:05:44,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-02-14 13:05:44,691 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 57 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:05:44,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 95 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:05:44,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-14 13:05:44,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-14 13:05:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2023-02-14 13:05:44,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2023-02-14 13:05:44,698 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2023-02-14 13:05:44,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:05:44,698 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2023-02-14 13:05:44,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2023-02-14 13:05:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2023-02-14 13:05:44,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 13:05:44,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:05:44,700 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:05:44,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-14 13:05:44,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:44,908 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:05:44,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:05:44,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2023-02-14 13:05:44,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:05:44,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231263901] [2023-02-14 13:05:44,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:44,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:05:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:44,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:05:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:44,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:44,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:44,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:44,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-14 13:05:45,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:05:45,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231263901] [2023-02-14 13:05:45,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231263901] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:05:45,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368767009] [2023-02-14 13:05:45,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:45,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:45,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:05:45,003 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:05:45,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-14 13:05:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:45,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 13:05:45,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:05:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 13:05:45,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:05:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-14 13:05:45,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368767009] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:05:45,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:05:45,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2023-02-14 13:05:45,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005694320] [2023-02-14 13:05:45,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:05:45,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 13:05:45,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:05:45,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 13:05:45,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-02-14 13:05:45,315 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2023-02-14 13:05:45,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:05:45,584 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2023-02-14 13:05:45,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 13:05:45,585 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2023-02-14 13:05:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:05:45,587 INFO L225 Difference]: With dead ends: 177 [2023-02-14 13:05:45,587 INFO L226 Difference]: Without dead ends: 117 [2023-02-14 13:05:45,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2023-02-14 13:05:45,588 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:05:45,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 222 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:05:45,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-14 13:05:45,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2023-02-14 13:05:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2023-02-14 13:05:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2023-02-14 13:05:45,601 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2023-02-14 13:05:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:05:45,601 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2023-02-14 13:05:45,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2023-02-14 13:05:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2023-02-14 13:05:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 13:05:45,604 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:05:45,604 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:05:45,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-14 13:05:45,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:45,814 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:05:45,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:05:45,814 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2023-02-14 13:05:45,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:05:45,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947413750] [2023-02-14 13:05:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:45,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:05:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:45,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:05:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:45,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:45,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:45,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:45,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:45,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:45,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-14 13:05:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-14 13:05:45,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:05:45,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947413750] [2023-02-14 13:05:45,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947413750] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:05:45,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728930527] [2023-02-14 13:05:45,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:45,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:45,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:05:45,940 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:05:45,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-14 13:05:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:45,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 13:05:45,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:05:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-14 13:05:46,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:05:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 13:05:46,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728930527] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:05:46,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:05:46,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2023-02-14 13:05:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784505372] [2023-02-14 13:05:46,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:05:46,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 13:05:46,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:05:46,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 13:05:46,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-02-14 13:05:46,400 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2023-02-14 13:05:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:05:46,734 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2023-02-14 13:05:46,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 13:05:46,735 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 51 [2023-02-14 13:05:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:05:46,738 INFO L225 Difference]: With dead ends: 255 [2023-02-14 13:05:46,738 INFO L226 Difference]: Without dead ends: 155 [2023-02-14 13:05:46,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2023-02-14 13:05:46,739 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:05:46,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 227 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:05:46,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-14 13:05:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2023-02-14 13:05:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2023-02-14 13:05:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2023-02-14 13:05:46,753 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2023-02-14 13:05:46,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:05:46,753 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2023-02-14 13:05:46,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 20 states have internal predecessors, (60), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2023-02-14 13:05:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2023-02-14 13:05:46,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-02-14 13:05:46,756 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:05:46,756 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:05:46,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-14 13:05:46,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:46,961 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:05:46,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:05:46,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1770426885, now seen corresponding path program 1 times [2023-02-14 13:05:46,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:05:46,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304310713] [2023-02-14 13:05:46,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:46,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:05:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:05:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-14 13:05:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 79 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-14 13:05:47,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:05:47,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304310713] [2023-02-14 13:05:47,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304310713] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:05:47,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477383816] [2023-02-14 13:05:47,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:47,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:47,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:05:47,230 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:05:47,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-14 13:05:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:47,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 13:05:47,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:05:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 119 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-02-14 13:05:47,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:05:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 129 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2023-02-14 13:05:47,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477383816] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:05:47,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:05:47,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2023-02-14 13:05:47,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319417077] [2023-02-14 13:05:47,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:05:47,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-14 13:05:47,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:05:47,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-14 13:05:47,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2023-02-14 13:05:47,999 INFO L87 Difference]: Start difference. First operand 109 states and 177 transitions. Second operand has 24 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 24 states have internal predecessors, (76), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2023-02-14 13:05:48,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:05:48,370 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2023-02-14 13:05:48,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-14 13:05:48,371 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 24 states have internal predecessors, (76), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) Word has length 107 [2023-02-14 13:05:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:05:48,372 INFO L225 Difference]: With dead ends: 240 [2023-02-14 13:05:48,372 INFO L226 Difference]: Without dead ends: 107 [2023-02-14 13:05:48,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 227 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2023-02-14 13:05:48,374 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 89 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:05:48,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 201 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:05:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-14 13:05:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2023-02-14 13:05:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 58 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (35), 17 states have call predecessors, (35), 14 states have call successors, (35) [2023-02-14 13:05:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2023-02-14 13:05:48,381 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 107 [2023-02-14 13:05:48,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:05:48,381 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2023-02-14 13:05:48,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 24 states have internal predecessors, (76), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 11 states have call predecessors, (27), 18 states have call successors, (27) [2023-02-14 13:05:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2023-02-14 13:05:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-02-14 13:05:48,384 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:05:48,384 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:05:48,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-14 13:05:48,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:48,590 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:05:48,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:05:48,591 INFO L85 PathProgramCache]: Analyzing trace with hash -222615371, now seen corresponding path program 1 times [2023-02-14 13:05:48,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:05:48,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691411867] [2023-02-14 13:05:48,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:48,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:05:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:05:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-14 13:05:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-02-14 13:05:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-14 13:05:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 62 proven. 123 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2023-02-14 13:05:48,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:05:48,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691411867] [2023-02-14 13:05:48,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691411867] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:05:48,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035978576] [2023-02-14 13:05:48,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:48,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:48,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:05:48,884 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:05:48,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 13:05:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:48,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-14 13:05:48,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:05:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 25 proven. 190 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2023-02-14 13:05:49,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:05:49,950 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 25 proven. 206 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2023-02-14 13:05:49,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035978576] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:05:49,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:05:49,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 26 [2023-02-14 13:05:49,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047929076] [2023-02-14 13:05:49,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:05:49,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 13:05:49,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:05:49,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 13:05:49,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2023-02-14 13:05:49,952 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 26 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 26 states have internal predecessors, (83), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2023-02-14 13:05:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:05:50,339 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2023-02-14 13:05:50,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-14 13:05:50,339 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 26 states have internal predecessors, (83), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) Word has length 134 [2023-02-14 13:05:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:05:50,340 INFO L225 Difference]: With dead ends: 214 [2023-02-14 13:05:50,341 INFO L226 Difference]: Without dead ends: 134 [2023-02-14 13:05:50,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 287 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2023-02-14 13:05:50,342 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 75 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:05:50,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 208 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:05:50,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-14 13:05:50,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2023-02-14 13:05:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 78 states have internal predecessors, (93), 20 states have call successors, (20), 11 states have call predecessors, (20), 16 states have return successors, (56), 24 states have call predecessors, (56), 20 states have call successors, (56) [2023-02-14 13:05:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2023-02-14 13:05:50,355 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 134 [2023-02-14 13:05:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:05:50,356 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2023-02-14 13:05:50,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 26 states have internal predecessors, (83), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2023-02-14 13:05:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2023-02-14 13:05:50,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2023-02-14 13:05:50,360 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:05:50,360 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 26, 26, 25, 22, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 8, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:05:50,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-14 13:05:50,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:50,569 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:05:50,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:05:50,569 INFO L85 PathProgramCache]: Analyzing trace with hash 12289001, now seen corresponding path program 1 times [2023-02-14 13:05:50,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:05:50,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979465297] [2023-02-14 13:05:50,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:50,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:05:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:50,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:05:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:05:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-14 13:05:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:05:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-02-14 13:05:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:05:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-14 13:05:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:05:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4131 backedges. 203 proven. 582 refuted. 0 times theorem prover too weak. 3346 trivial. 0 not checked. [2023-02-14 13:05:51,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:05:51,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979465297] [2023-02-14 13:05:51,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979465297] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:05:51,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602407167] [2023-02-14 13:05:51,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:51,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:51,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:05:51,406 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:05:51,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-14 13:05:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:51,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-14 13:05:51,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:05:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4131 backedges. 113 proven. 823 refuted. 0 times theorem prover too weak. 3195 trivial. 0 not checked. [2023-02-14 13:05:51,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:05:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4131 backedges. 113 proven. 847 refuted. 0 times theorem prover too weak. 3171 trivial. 0 not checked. [2023-02-14 13:05:53,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602407167] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:05:53,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:05:53,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 28 [2023-02-14 13:05:53,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759697313] [2023-02-14 13:05:53,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:05:53,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-14 13:05:53,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:05:53,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-14 13:05:53,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2023-02-14 13:05:53,316 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 28 states, 26 states have (on average 3.5) internal successors, (91), 28 states have internal predecessors, (91), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) [2023-02-14 13:05:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:05:53,821 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2023-02-14 13:05:53,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-14 13:05:53,821 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.5) internal successors, (91), 28 states have internal predecessors, (91), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) Word has length 381 [2023-02-14 13:05:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:05:53,824 INFO L225 Difference]: With dead ends: 260 [2023-02-14 13:05:53,824 INFO L226 Difference]: Without dead ends: 155 [2023-02-14 13:05:53,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 851 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=342, Invalid=1638, Unknown=0, NotChecked=0, Total=1980 [2023-02-14 13:05:53,825 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 97 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:05:53,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 259 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 13:05:53,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-14 13:05:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2023-02-14 13:05:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 99 states have internal predecessors, (125), 26 states have call successors, (26), 18 states have call predecessors, (26), 17 states have return successors, (73), 27 states have call predecessors, (73), 26 states have call successors, (73) [2023-02-14 13:05:53,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2023-02-14 13:05:53,847 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 381 [2023-02-14 13:05:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:05:53,848 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2023-02-14 13:05:53,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.5) internal successors, (91), 28 states have internal predecessors, (91), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) [2023-02-14 13:05:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2023-02-14 13:05:53,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2023-02-14 13:05:53,852 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:05:53,853 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 27, 27, 24, 23, 16, 16, 16, 16, 16, 16, 16, 13, 13, 13, 13, 13, 13, 13, 11, 8, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:05:53,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-14 13:05:54,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-14 13:05:54,060 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:05:54,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:05:54,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1938766977, now seen corresponding path program 2 times [2023-02-14 13:05:54,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:05:54,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063123203] [2023-02-14 13:05:54,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:54,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:05:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:05:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:05:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-02-14 13:05:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-02-14 13:05:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:05:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2023-02-14 13:05:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:05:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:05:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4709 backedges. 264 proven. 658 refuted. 0 times theorem prover too weak. 3787 trivial. 0 not checked. [2023-02-14 13:05:54,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:05:54,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063123203] [2023-02-14 13:05:54,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063123203] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:05:54,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736005210] [2023-02-14 13:05:54,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 13:05:54,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:54,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:05:54,922 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:05:54,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-14 13:05:55,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 13:05:55,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:05:55,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-14 13:05:55,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:05:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4709 backedges. 158 proven. 973 refuted. 0 times theorem prover too weak. 3578 trivial. 0 not checked. [2023-02-14 13:05:55,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:05:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4709 backedges. 158 proven. 1006 refuted. 0 times theorem prover too weak. 3545 trivial. 0 not checked. [2023-02-14 13:05:57,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736005210] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:05:57,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:05:57,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 19] total 30 [2023-02-14 13:05:57,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823111285] [2023-02-14 13:05:57,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:05:57,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-14 13:05:57,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:05:57,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-14 13:05:57,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2023-02-14 13:05:57,308 INFO L87 Difference]: Start difference. First operand 145 states and 224 transitions. Second operand has 30 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 30 states have internal predecessors, (97), 24 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (40), 15 states have call predecessors, (40), 24 states have call successors, (40) [2023-02-14 13:05:57,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:05:57,923 INFO L93 Difference]: Finished difference Result 334 states and 594 transitions. [2023-02-14 13:05:57,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-14 13:05:57,924 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 30 states have internal predecessors, (97), 24 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (40), 15 states have call predecessors, (40), 24 states have call successors, (40) Word has length 405 [2023-02-14 13:05:57,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:05:57,928 INFO L225 Difference]: With dead ends: 334 [2023-02-14 13:05:57,928 INFO L226 Difference]: Without dead ends: 197 [2023-02-14 13:05:57,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 961 GetRequests, 905 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=2044, Unknown=0, NotChecked=0, Total=2450 [2023-02-14 13:05:57,930 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 114 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:05:57,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 246 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 13:05:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-14 13:05:57,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 173. [2023-02-14 13:05:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 118 states have internal predecessors, (148), 32 states have call successors, (32), 24 states have call predecessors, (32), 18 states have return successors, (92), 30 states have call predecessors, (92), 32 states have call successors, (92) [2023-02-14 13:05:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 272 transitions. [2023-02-14 13:05:57,943 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 272 transitions. Word has length 405 [2023-02-14 13:05:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:05:57,944 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 272 transitions. [2023-02-14 13:05:57,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.4642857142857144) internal successors, (97), 30 states have internal predecessors, (97), 24 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (40), 15 states have call predecessors, (40), 24 states have call successors, (40) [2023-02-14 13:05:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 272 transitions. [2023-02-14 13:05:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2023-02-14 13:05:57,956 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:05:57,956 INFO L195 NwaCegarLoop]: trace histogram [54, 54, 53, 53, 44, 43, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 18, 16, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:05:57,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-14 13:05:58,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:58,162 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:05:58,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:05:58,162 INFO L85 PathProgramCache]: Analyzing trace with hash 286482761, now seen corresponding path program 3 times [2023-02-14 13:05:58,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:05:58,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657446954] [2023-02-14 13:05:58,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:05:58,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:05:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:58,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:05:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:05:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:05:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-02-14 13:05:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:05:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-02-14 13:05:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:05:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2023-02-14 13:05:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:05:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:05:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-02-14 13:05:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:05:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-02-14 13:05:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:05:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:05:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:05:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:05:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:05:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:05:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 15789 backedges. 477 proven. 1828 refuted. 0 times theorem prover too weak. 13484 trivial. 0 not checked. [2023-02-14 13:05:59,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:05:59,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657446954] [2023-02-14 13:05:59,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657446954] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:05:59,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813742550] [2023-02-14 13:05:59,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 13:05:59,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:05:59,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:05:59,907 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:05:59,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-14 13:06:00,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2023-02-14 13:06:00,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:06:00,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-14 13:06:00,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:06:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15789 backedges. 5359 proven. 165 refuted. 0 times theorem prover too weak. 10265 trivial. 0 not checked. [2023-02-14 13:06:00,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:06:02,138 INFO L134 CoverageAnalysis]: Checked inductivity of 15789 backedges. 1603 proven. 430 refuted. 0 times theorem prover too weak. 13756 trivial. 0 not checked. [2023-02-14 13:06:02,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813742550] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:06:02,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:06:02,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 15] total 33 [2023-02-14 13:06:02,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358851878] [2023-02-14 13:06:02,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:06:02,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-14 13:06:02,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:06:02,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-14 13:06:02,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2023-02-14 13:06:02,141 INFO L87 Difference]: Start difference. First operand 173 states and 272 transitions. Second operand has 33 states, 32 states have (on average 3.53125) internal successors, (113), 33 states have internal predecessors, (113), 19 states have call successors, (38), 2 states have call predecessors, (38), 13 states have return successors, (45), 25 states have call predecessors, (45), 19 states have call successors, (45) [2023-02-14 13:06:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:06:02,791 INFO L93 Difference]: Finished difference Result 380 states and 642 transitions. [2023-02-14 13:06:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-14 13:06:02,792 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.53125) internal successors, (113), 33 states have internal predecessors, (113), 19 states have call successors, (38), 2 states have call predecessors, (38), 13 states have return successors, (45), 25 states have call predecessors, (45), 19 states have call successors, (45) Word has length 733 [2023-02-14 13:06:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:06:02,793 INFO L225 Difference]: With dead ends: 380 [2023-02-14 13:06:02,793 INFO L226 Difference]: Without dead ends: 210 [2023-02-14 13:06:02,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1720 GetRequests, 1659 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=449, Invalid=2631, Unknown=0, NotChecked=0, Total=3080 [2023-02-14 13:06:02,795 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 111 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:06:02,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 347 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 13:06:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-02-14 13:06:02,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 195. [2023-02-14 13:06:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 138 states have (on average 1.1521739130434783) internal successors, (159), 133 states have internal predecessors, (159), 37 states have call successors, (37), 29 states have call predecessors, (37), 19 states have return successors, (104), 32 states have call predecessors, (104), 37 states have call successors, (104) [2023-02-14 13:06:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 300 transitions. [2023-02-14 13:06:02,805 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 300 transitions. Word has length 733 [2023-02-14 13:06:02,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:06:02,805 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 300 transitions. [2023-02-14 13:06:02,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.53125) internal successors, (113), 33 states have internal predecessors, (113), 19 states have call successors, (38), 2 states have call predecessors, (38), 13 states have return successors, (45), 25 states have call predecessors, (45), 19 states have call successors, (45) [2023-02-14 13:06:02,805 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 300 transitions. [2023-02-14 13:06:02,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2023-02-14 13:06:02,808 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:06:02,808 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 43, 43, 35, 35, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 14, 13, 9, 8, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:06:02,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-14 13:06:03,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-14 13:06:03,014 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:06:03,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:06:03,014 INFO L85 PathProgramCache]: Analyzing trace with hash 976696515, now seen corresponding path program 4 times [2023-02-14 13:06:03,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:06:03,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758959744] [2023-02-14 13:06:03,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:06:03,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:06:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:06:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:03,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:03,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:03,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-14 13:06:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-02-14 13:06:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2023-02-14 13:06:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-14 13:06:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10350 backedges. 589 proven. 1541 refuted. 0 times theorem prover too weak. 8220 trivial. 0 not checked. [2023-02-14 13:06:04,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:06:04,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758959744] [2023-02-14 13:06:04,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758959744] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:06:04,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371826523] [2023-02-14 13:06:04,381 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 13:06:04,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:06:04,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:06:04,383 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:06:04,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-14 13:06:04,597 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 13:06:04,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:06:04,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-14 13:06:04,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:06:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10350 backedges. 263 proven. 1689 refuted. 0 times theorem prover too weak. 8398 trivial. 0 not checked. [2023-02-14 13:06:04,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:06:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10350 backedges. 263 proven. 1733 refuted. 0 times theorem prover too weak. 8354 trivial. 0 not checked. [2023-02-14 13:06:07,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371826523] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:06:07,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:06:07,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 21] total 37 [2023-02-14 13:06:07,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204601538] [2023-02-14 13:06:07,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:06:07,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-14 13:06:07,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:06:07,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-14 13:06:07,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2023-02-14 13:06:07,455 INFO L87 Difference]: Start difference. First operand 195 states and 300 transitions. Second operand has 37 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 37 states have internal predecessors, (111), 30 states have call successors, (36), 1 states have call predecessors, (36), 15 states have return successors, (50), 22 states have call predecessors, (50), 30 states have call successors, (50) [2023-02-14 13:06:08,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:06:08,324 INFO L93 Difference]: Finished difference Result 454 states and 802 transitions. [2023-02-14 13:06:08,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-14 13:06:08,324 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 37 states have internal predecessors, (111), 30 states have call successors, (36), 1 states have call predecessors, (36), 15 states have return successors, (50), 22 states have call predecessors, (50), 30 states have call successors, (50) Word has length 596 [2023-02-14 13:06:08,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:06:08,327 INFO L225 Difference]: With dead ends: 454 [2023-02-14 13:06:08,327 INFO L226 Difference]: Without dead ends: 256 [2023-02-14 13:06:08,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1411 GetRequests, 1341 SyntacticMatches, 10 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=586, Invalid=3196, Unknown=0, NotChecked=0, Total=3782 [2023-02-14 13:06:08,329 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 138 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 13:06:08,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 353 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-14 13:06:08,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-02-14 13:06:08,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 226. [2023-02-14 13:06:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 160 states have (on average 1.125) internal successors, (180), 155 states have internal predecessors, (180), 45 states have call successors, (45), 35 states have call predecessors, (45), 20 states have return successors, (121), 35 states have call predecessors, (121), 45 states have call successors, (121) [2023-02-14 13:06:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 346 transitions. [2023-02-14 13:06:08,341 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 346 transitions. Word has length 596 [2023-02-14 13:06:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:06:08,342 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 346 transitions. [2023-02-14 13:06:08,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 37 states have internal predecessors, (111), 30 states have call successors, (36), 1 states have call predecessors, (36), 15 states have return successors, (50), 22 states have call predecessors, (50), 30 states have call successors, (50) [2023-02-14 13:06:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 346 transitions. [2023-02-14 13:06:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 802 [2023-02-14 13:06:08,346 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:06:08,346 INFO L195 NwaCegarLoop]: trace histogram [61, 61, 56, 56, 50, 45, 30, 30, 30, 30, 30, 30, 30, 28, 28, 28, 28, 28, 28, 28, 22, 15, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:06:08,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-14 13:06:08,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-14 13:06:08,552 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:06:08,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:06:08,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1924607220, now seen corresponding path program 5 times [2023-02-14 13:06:08,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:06:08,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601967414] [2023-02-14 13:06:08,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:06:08,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:06:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:09,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:06:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:09,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:09,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-02-14 13:06:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-02-14 13:06:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-02-14 13:06:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2023-02-14 13:06:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 582 [2023-02-14 13:06:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-02-14 13:06:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18947 backedges. 1777 proven. 2284 refuted. 0 times theorem prover too weak. 14886 trivial. 0 not checked. [2023-02-14 13:06:10,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:06:10,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601967414] [2023-02-14 13:06:10,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601967414] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:06:10,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74355701] [2023-02-14 13:06:10,689 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 13:06:10,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:06:10,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:06:10,690 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:06:10,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-14 13:06:10,925 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2023-02-14 13:06:10,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:06:10,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-14 13:06:10,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:06:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 18947 backedges. 10330 proven. 142 refuted. 0 times theorem prover too weak. 8475 trivial. 0 not checked. [2023-02-14 13:06:11,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:06:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 18947 backedges. 1295 proven. 1587 refuted. 0 times theorem prover too weak. 16065 trivial. 0 not checked. [2023-02-14 13:06:13,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74355701] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:06:13,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:06:13,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 14, 17] total 40 [2023-02-14 13:06:13,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787976114] [2023-02-14 13:06:13,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:06:13,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-02-14 13:06:13,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:06:13,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-14 13:06:13,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1322, Unknown=0, NotChecked=0, Total=1560 [2023-02-14 13:06:13,427 INFO L87 Difference]: Start difference. First operand 226 states and 346 transitions. Second operand has 40 states, 40 states have (on average 3.175) internal successors, (127), 40 states have internal predecessors, (127), 28 states have call successors, (43), 2 states have call predecessors, (43), 16 states have return successors, (56), 29 states have call predecessors, (56), 28 states have call successors, (56) [2023-02-14 13:06:14,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:06:14,164 INFO L93 Difference]: Finished difference Result 481 states and 814 transitions. [2023-02-14 13:06:14,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-14 13:06:14,165 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.175) internal successors, (127), 40 states have internal predecessors, (127), 28 states have call successors, (43), 2 states have call predecessors, (43), 16 states have return successors, (56), 29 states have call predecessors, (56), 28 states have call successors, (56) Word has length 801 [2023-02-14 13:06:14,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:06:14,167 INFO L225 Difference]: With dead ends: 481 [2023-02-14 13:06:14,167 INFO L226 Difference]: Without dead ends: 266 [2023-02-14 13:06:14,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1876 GetRequests, 1816 SyntacticMatches, 9 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=434, Invalid=2322, Unknown=0, NotChecked=0, Total=2756 [2023-02-14 13:06:14,173 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 86 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 13:06:14,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 628 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1628 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-14 13:06:14,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-02-14 13:06:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 237. [2023-02-14 13:06:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 169 states have (on average 1.047337278106509) internal successors, (177), 164 states have internal predecessors, (177), 47 states have call successors, (47), 38 states have call predecessors, (47), 20 states have return successors, (137), 34 states have call predecessors, (137), 47 states have call successors, (137) [2023-02-14 13:06:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 361 transitions. [2023-02-14 13:06:14,186 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 361 transitions. Word has length 801 [2023-02-14 13:06:14,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:06:14,187 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 361 transitions. [2023-02-14 13:06:14,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.175) internal successors, (127), 40 states have internal predecessors, (127), 28 states have call successors, (43), 2 states have call predecessors, (43), 16 states have return successors, (56), 29 states have call predecessors, (56), 28 states have call successors, (56) [2023-02-14 13:06:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 361 transitions. [2023-02-14 13:06:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2023-02-14 13:06:14,195 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:06:14,196 INFO L195 NwaCegarLoop]: trace histogram [91, 91, 86, 86, 72, 71, 45, 45, 45, 45, 45, 45, 45, 43, 43, 43, 43, 43, 43, 43, 29, 26, 19, 15, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:06:14,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-14 13:06:14,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-14 13:06:14,403 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:06:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:06:14,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1731688204, now seen corresponding path program 6 times [2023-02-14 13:06:14,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:06:14,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781657233] [2023-02-14 13:06:14,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:06:14,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:06:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:15,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:06:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-14 13:06:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-02-14 13:06:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2023-02-14 13:06:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 527 [2023-02-14 13:06:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:16,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-14 13:06:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-02-14 13:06:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2023-02-14 13:06:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2023-02-14 13:06:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 568 [2023-02-14 13:06:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 43613 backedges. 840 proven. 4036 refuted. 0 times theorem prover too weak. 38737 trivial. 0 not checked. [2023-02-14 13:06:17,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:06:17,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781657233] [2023-02-14 13:06:17,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781657233] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:06:17,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657981787] [2023-02-14 13:06:17,211 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 13:06:17,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:06:17,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:06:17,213 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:06:17,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-14 13:06:17,486 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2023-02-14 13:06:17,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:06:17,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-14 13:06:17,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:06:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 43613 backedges. 908 proven. 2839 refuted. 0 times theorem prover too weak. 39866 trivial. 0 not checked. [2023-02-14 13:06:17,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:06:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 43613 backedges. 912 proven. 2868 refuted. 0 times theorem prover too weak. 39833 trivial. 0 not checked. [2023-02-14 13:06:20,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657981787] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:06:20,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:06:20,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 19] total 35 [2023-02-14 13:06:20,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549595641] [2023-02-14 13:06:20,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:06:20,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-14 13:06:20,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:06:20,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-14 13:06:20,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2023-02-14 13:06:20,951 INFO L87 Difference]: Start difference. First operand 237 states and 361 transitions. Second operand has 35 states, 34 states have (on average 3.1176470588235294) internal successors, (106), 35 states have internal predecessors, (106), 27 states have call successors, (35), 1 states have call predecessors, (35), 14 states have return successors, (48), 23 states have call predecessors, (48), 27 states have call successors, (48) [2023-02-14 13:06:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:06:21,681 INFO L93 Difference]: Finished difference Result 602 states and 1018 transitions. [2023-02-14 13:06:21,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-14 13:06:21,681 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.1176470588235294) internal successors, (106), 35 states have internal predecessors, (106), 27 states have call successors, (35), 1 states have call predecessors, (35), 14 states have return successors, (48), 23 states have call predecessors, (48), 27 states have call successors, (48) Word has length 1209 [2023-02-14 13:06:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:06:21,699 INFO L225 Difference]: With dead ends: 602 [2023-02-14 13:06:21,699 INFO L226 Difference]: Without dead ends: 375 [2023-02-14 13:06:21,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2817 GetRequests, 2751 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=534, Invalid=2888, Unknown=0, NotChecked=0, Total=3422 [2023-02-14 13:06:21,703 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 132 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 13:06:21,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 320 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 13:06:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-02-14 13:06:21,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 289. [2023-02-14 13:06:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 207 states have (on average 1.0483091787439613) internal successors, (217), 201 states have internal predecessors, (217), 58 states have call successors, (58), 48 states have call predecessors, (58), 23 states have return successors, (186), 39 states have call predecessors, (186), 58 states have call successors, (186) [2023-02-14 13:06:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 461 transitions. [2023-02-14 13:06:21,722 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 461 transitions. Word has length 1209 [2023-02-14 13:06:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:06:21,724 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 461 transitions. [2023-02-14 13:06:21,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.1176470588235294) internal successors, (106), 35 states have internal predecessors, (106), 27 states have call successors, (35), 1 states have call predecessors, (35), 14 states have return successors, (48), 23 states have call predecessors, (48), 27 states have call successors, (48) [2023-02-14 13:06:21,724 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 461 transitions. [2023-02-14 13:06:21,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1796 [2023-02-14 13:06:21,767 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:06:21,767 INFO L195 NwaCegarLoop]: trace histogram [132, 132, 131, 131, 107, 106, 66, 66, 66, 66, 66, 66, 66, 65, 65, 65, 65, 65, 65, 65, 41, 41, 26, 24, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:06:21,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-14 13:06:21,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-14 13:06:21,968 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:06:21,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:06:21,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1486741675, now seen corresponding path program 7 times [2023-02-14 13:06:21,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:06:21,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091902761] [2023-02-14 13:06:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:06:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:06:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:23,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:06:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:25,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:25,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:25,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-14 13:06:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-14 13:06:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2023-02-14 13:06:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-14 13:06:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-14 13:06:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2023-02-14 13:06:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:26,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 963 [2023-02-14 13:06:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:27,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:27,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:27,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:27,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-14 13:06:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-14 13:06:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2023-02-14 13:06:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2023-02-14 13:06:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 609 [2023-02-14 13:06:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 718 [2023-02-14 13:06:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 96780 backedges. 8046 proven. 6041 refuted. 0 times theorem prover too weak. 82693 trivial. 0 not checked. [2023-02-14 13:06:28,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:06:28,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091902761] [2023-02-14 13:06:28,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091902761] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:06:28,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383875298] [2023-02-14 13:06:28,478 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-14 13:06:28,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:06:28,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:06:28,480 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:06:28,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-14 13:06:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:29,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 4009 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-14 13:06:29,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:06:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 96780 backedges. 2485 proven. 4853 refuted. 0 times theorem prover too weak. 89442 trivial. 0 not checked. [2023-02-14 13:06:29,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:06:35,020 INFO L134 CoverageAnalysis]: Checked inductivity of 96780 backedges. 2485 proven. 4905 refuted. 0 times theorem prover too weak. 89390 trivial. 0 not checked. [2023-02-14 13:06:35,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383875298] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:06:35,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:06:35,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 15, 23] total 59 [2023-02-14 13:06:35,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167727787] [2023-02-14 13:06:35,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:06:35,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-02-14 13:06:35,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:06:35,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-02-14 13:06:35,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=2949, Unknown=0, NotChecked=0, Total=3422 [2023-02-14 13:06:35,025 INFO L87 Difference]: Start difference. First operand 289 states and 461 transitions. Second operand has 59 states, 57 states have (on average 2.56140350877193) internal successors, (146), 59 states have internal predecessors, (146), 43 states have call successors, (53), 1 states have call predecessors, (53), 23 states have return successors, (76), 44 states have call predecessors, (76), 43 states have call successors, (76) [2023-02-14 13:06:36,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:06:36,399 INFO L93 Difference]: Finished difference Result 615 states and 1152 transitions. [2023-02-14 13:06:36,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-02-14 13:06:36,400 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 57 states have (on average 2.56140350877193) internal successors, (146), 59 states have internal predecessors, (146), 43 states have call successors, (53), 1 states have call predecessors, (53), 23 states have return successors, (76), 44 states have call predecessors, (76), 43 states have call successors, (76) Word has length 1795 [2023-02-14 13:06:36,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:06:36,403 INFO L225 Difference]: With dead ends: 615 [2023-02-14 13:06:36,403 INFO L226 Difference]: Without dead ends: 299 [2023-02-14 13:06:36,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4179 GetRequests, 4090 SyntacticMatches, 11 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3022 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=819, Invalid=5501, Unknown=0, NotChecked=0, Total=6320 [2023-02-14 13:06:36,407 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 145 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 3295 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 3295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:06:36,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1216 Invalid, 3581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 3295 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-14 13:06:36,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-02-14 13:06:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 272. [2023-02-14 13:06:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 195 states have (on average 1.041025641025641) internal successors, (203), 190 states have internal predecessors, (203), 55 states have call successors, (55), 46 states have call predecessors, (55), 21 states have return successors, (87), 35 states have call predecessors, (87), 55 states have call successors, (87) [2023-02-14 13:06:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 345 transitions. [2023-02-14 13:06:36,420 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 345 transitions. Word has length 1795 [2023-02-14 13:06:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:06:36,421 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 345 transitions. [2023-02-14 13:06:36,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 57 states have (on average 2.56140350877193) internal successors, (146), 59 states have internal predecessors, (146), 43 states have call successors, (53), 1 states have call predecessors, (53), 23 states have return successors, (76), 44 states have call predecessors, (76), 43 states have call successors, (76) [2023-02-14 13:06:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 345 transitions. [2023-02-14 13:06:36,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2023-02-14 13:06:36,429 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:06:36,429 INFO L195 NwaCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 18, 16, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:06:36,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-02-14 13:06:36,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:06:36,638 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:06:36,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:06:36,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1351437924, now seen corresponding path program 8 times [2023-02-14 13:06:36,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:06:36,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586126438] [2023-02-14 13:06:36,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:06:36,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:06:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:37,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 13:06:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:38,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:38,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-14 13:06:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-14 13:06:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-14 13:06:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 568 [2023-02-14 13:06:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-14 13:06:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 854 [2023-02-14 13:06:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:39,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-14 13:06:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-14 13:06:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-14 13:06:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 13:06:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-14 13:06:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 13:06:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 13:06:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:06:40,254 INFO L134 CoverageAnalysis]: Checked inductivity of 43585 backedges. 4637 proven. 3643 refuted. 0 times theorem prover too weak. 35305 trivial. 0 not checked. [2023-02-14 13:06:40,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:06:40,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586126438] [2023-02-14 13:06:40,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586126438] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:06:40,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406187916] [2023-02-14 13:06:40,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 13:06:40,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:06:40,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:06:40,256 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:06:40,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-14 13:06:40,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 13:06:40,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 13:06:40,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 2708 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-14 13:06:40,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:06:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 43585 backedges. 1511 proven. 3171 refuted. 0 times theorem prover too weak. 38903 trivial. 0 not checked. [2023-02-14 13:06:40,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:06:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 43585 backedges. 1513 proven. 3221 refuted. 0 times theorem prover too weak. 38851 trivial. 0 not checked. [2023-02-14 13:06:45,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406187916] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:06:45,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:06:45,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 15, 23] total 51 [2023-02-14 13:06:45,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839650806] [2023-02-14 13:06:45,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:06:45,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-14 13:06:45,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:06:45,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-14 13:06:45,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=2213, Unknown=0, NotChecked=0, Total=2550 [2023-02-14 13:06:45,268 INFO L87 Difference]: Start difference. First operand 272 states and 345 transitions. Second operand has 51 states, 49 states have (on average 2.693877551020408) internal successors, (132), 51 states have internal predecessors, (132), 37 states have call successors, (44), 1 states have call predecessors, (44), 21 states have return successors, (62), 35 states have call predecessors, (62), 37 states have call successors, (62) [2023-02-14 13:06:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:06:46,398 INFO L93 Difference]: Finished difference Result 580 states and 742 transitions. [2023-02-14 13:06:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-02-14 13:06:46,399 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 2.693877551020408) internal successors, (132), 51 states have internal predecessors, (132), 37 states have call successors, (44), 1 states have call predecessors, (44), 21 states have return successors, (62), 35 states have call predecessors, (62), 37 states have call successors, (62) Word has length 1209 [2023-02-14 13:06:46,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:06:46,401 INFO L225 Difference]: With dead ends: 580 [2023-02-14 13:06:46,401 INFO L226 Difference]: Without dead ends: 312 [2023-02-14 13:06:46,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2842 GetRequests, 2750 SyntacticMatches, 11 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2495 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=852, Invalid=5954, Unknown=0, NotChecked=0, Total=6806 [2023-02-14 13:06:46,404 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 129 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 2112 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 2427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 2112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 13:06:46,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 844 Invalid, 2427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 2112 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 13:06:46,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-02-14 13:06:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 233. [2023-02-14 13:06:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 165 states have (on average 1.0363636363636364) internal successors, (171), 162 states have internal predecessors, (171), 47 states have call successors, (47), 37 states have call predecessors, (47), 20 states have return successors, (58), 33 states have call predecessors, (58), 47 states have call successors, (58) [2023-02-14 13:06:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 276 transitions. [2023-02-14 13:06:46,415 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 276 transitions. Word has length 1209 [2023-02-14 13:06:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:06:46,416 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 276 transitions. [2023-02-14 13:06:46,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 2.693877551020408) internal successors, (132), 51 states have internal predecessors, (132), 37 states have call successors, (44), 1 states have call predecessors, (44), 21 states have return successors, (62), 35 states have call predecessors, (62), 37 states have call successors, (62) [2023-02-14 13:06:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 276 transitions. [2023-02-14 13:06:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2023-02-14 13:06:46,424 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:06:46,424 INFO L195 NwaCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:06:46,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-14 13:06:46,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-14 13:06:46,634 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 13:06:46,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:06:46,635 INFO L85 PathProgramCache]: Analyzing trace with hash -553145382, now seen corresponding path program 9 times [2023-02-14 13:06:46,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:06:46,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93299340] [2023-02-14 13:06:46,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:06:46,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:06:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 13:06:46,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 13:06:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 13:06:47,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 13:06:47,058 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 13:06:47,059 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-14 13:06:47,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-14 13:06:47,063 INFO L445 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:06:47,067 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 13:06:47,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 01:06:47 BoogieIcfgContainer [2023-02-14 13:06:47,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 13:06:47,193 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 13:06:47,193 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 13:06:47,193 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 13:06:47,193 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:05:41" (3/4) ... [2023-02-14 13:06:47,195 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-14 13:06:47,301 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-14 13:06:47,302 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 13:06:47,302 INFO L158 Benchmark]: Toolchain (without parser) took 65848.84ms. Allocated memory was 134.2MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 98.9MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 469.1MB. Max. memory is 16.1GB. [2023-02-14 13:06:47,303 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 98.6MB. Free memory is still 51.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 13:06:47,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 126.60ms. Allocated memory is still 134.2MB. Free memory was 98.6MB in the beginning and 88.5MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 13:06:47,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.77ms. Allocated memory is still 134.2MB. Free memory was 88.5MB in the beginning and 87.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 13:06:47,304 INFO L158 Benchmark]: Boogie Preprocessor took 11.95ms. Allocated memory is still 134.2MB. Free memory was 87.2MB in the beginning and 86.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 13:06:47,304 INFO L158 Benchmark]: RCFGBuilder took 179.72ms. Allocated memory is still 134.2MB. Free memory was 86.0MB in the beginning and 76.4MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 13:06:47,305 INFO L158 Benchmark]: TraceAbstraction took 65399.27ms. Allocated memory was 134.2MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 75.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 420.9MB. Max. memory is 16.1GB. [2023-02-14 13:06:47,305 INFO L158 Benchmark]: Witness Printer took 109.03ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-02-14 13:06:47,308 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.13ms. Allocated memory is still 98.6MB. Free memory is still 51.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 126.60ms. Allocated memory is still 134.2MB. Free memory was 98.6MB in the beginning and 88.5MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.77ms. Allocated memory is still 134.2MB. Free memory was 88.5MB in the beginning and 87.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.95ms. Allocated memory is still 134.2MB. Free memory was 87.2MB in the beginning and 86.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 179.72ms. Allocated memory is still 134.2MB. Free memory was 86.0MB in the beginning and 76.4MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 65399.27ms. Allocated memory was 134.2MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 75.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 420.9MB. Max. memory is 16.1GB. * Witness Printer took 109.03ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 10; VAL [x=10] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L10] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L12] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L20] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L22] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L20] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L22] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L39] int result = fibo1(x); [L40] COND TRUE result == 55 VAL [result=55, x=10] [L41] reach_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 65.2s, OverallIterations: 18, TraceHistogramMax: 132, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.1s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1423 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1337 mSDsluCounter, 5615 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5007 mSDsCounter, 2240 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14538 IncrementalHoareTripleChecker+Invalid, 16778 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2240 mSolverCounterUnsat, 608 mSDtfsCounter, 14538 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17785 GetRequests, 17039 SyntacticMatches, 97 SemanticMatches, 649 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11887 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=289occurred in iteration=15, InterpolantAutomatonStates: 483, 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, 17 MinimizatonAttempts, 409 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 49.1s InterpolantComputationTime, 16312 NumberOfCodeBlocks, 14639 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 22597 ConstructedInterpolants, 0 QuantifiedInterpolants, 28511 SizeOfPredicates, 90 NumberOfNonLiveVariables, 13272 ConjunctsInSsa, 210 ConjunctsInUnsatCore, 47 InterpolantComputations, 2 PerfectInterpolantSequences, 663396/716226 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-14 13:06:47,348 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