./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 a31fd051 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-?-a31fd05 [2023-02-15 12:39:13,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 12:39:13,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 12:39:13,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 12:39:13,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 12:39:13,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 12:39:13,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 12:39:13,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 12:39:13,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 12:39:13,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 12:39:13,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 12:39:13,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 12:39:13,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 12:39:13,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 12:39:13,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 12:39:13,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 12:39:13,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 12:39:13,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 12:39:13,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 12:39:13,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 12:39:13,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 12:39:13,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 12:39:13,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 12:39:13,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 12:39:13,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 12:39:13,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 12:39:13,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 12:39:13,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 12:39:13,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 12:39:13,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 12:39:13,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 12:39:13,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 12:39:13,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 12:39:13,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 12:39:13,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 12:39:13,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 12:39:13,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 12:39:13,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 12:39:13,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 12:39:13,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 12:39:13,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 12:39:13,650 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 12:39:13,671 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 12:39:13,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 12:39:13,673 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 12:39:13,673 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 12:39:13,674 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 12:39:13,674 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 12:39:13,675 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 12:39:13,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 12:39:13,676 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 12:39:13,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 12:39:13,677 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 12:39:13,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 12:39:13,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 12:39:13,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 12:39:13,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 12:39:13,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 12:39:13,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 12:39:13,678 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 12:39:13,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 12:39:13,678 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 12:39:13,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 12:39:13,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 12:39:13,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 12:39:13,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 12:39:13,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 12:39:13,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 12:39:13,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 12:39:13,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 12:39:13,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 12:39:13,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 12:39:13,680 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 12:39:13,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 12:39:13,681 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 12:39:13,681 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 12:39:13,681 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 12:39:13,681 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-15 12:39:13,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 12:39:13,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 12:39:13,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 12:39:13,970 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 12:39:13,970 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 12:39:13,971 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-15 12:39:15,083 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 12:39:15,230 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 12:39:15,231 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2023-02-15 12:39:15,236 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5beebda72/487c80f839d6444bbf62fa800ce0e07c/FLAGdf2ec56f1 [2023-02-15 12:39:15,251 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5beebda72/487c80f839d6444bbf62fa800ce0e07c [2023-02-15 12:39:15,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 12:39:15,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 12:39:15,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 12:39:15,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 12:39:15,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 12:39:15,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:39:15" (1/1) ... [2023-02-15 12:39:15,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e749aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:15, skipping insertion in model container [2023-02-15 12:39:15,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:39:15" (1/1) ... [2023-02-15 12:39:15,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 12:39:15,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 12:39:15,385 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-15 12:39:15,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 12:39:15,395 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 12:39:15,408 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-15 12:39:15,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 12:39:15,418 INFO L208 MainTranslator]: Completed translation [2023-02-15 12:39:15,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:15 WrapperNode [2023-02-15 12:39:15,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 12:39:15,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 12:39:15,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 12:39:15,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 12:39:15,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:15" (1/1) ... [2023-02-15 12:39:15,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:15" (1/1) ... [2023-02-15 12:39:15,440 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2023-02-15 12:39:15,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 12:39:15,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 12:39:15,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 12:39:15,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 12:39:15,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:15" (1/1) ... [2023-02-15 12:39:15,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:15" (1/1) ... [2023-02-15 12:39:15,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:15" (1/1) ... [2023-02-15 12:39:15,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:15" (1/1) ... [2023-02-15 12:39:15,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:15" (1/1) ... [2023-02-15 12:39:15,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:15" (1/1) ... [2023-02-15 12:39:15,464 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:15" (1/1) ... [2023-02-15 12:39:15,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:15" (1/1) ... [2023-02-15 12:39:15,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 12:39:15,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 12:39:15,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 12:39:15,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 12:39:15,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:15" (1/1) ... [2023-02-15 12:39:15,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 12:39:15,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:39:15,493 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-15 12:39:15,495 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-15 12:39:15,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 12:39:15,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 12:39:15,518 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-02-15 12:39:15,519 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-02-15 12:39:15,519 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-02-15 12:39:15,519 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-02-15 12:39:15,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 12:39:15,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 12:39:15,571 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 12:39:15,572 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 12:39:15,663 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 12:39:15,669 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 12:39:15,669 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-15 12:39:15,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:39:15 BoogieIcfgContainer [2023-02-15 12:39:15,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 12:39:15,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 12:39:15,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 12:39:15,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 12:39:15,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:39:15" (1/3) ... [2023-02-15 12:39:15,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106327e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:39:15, skipping insertion in model container [2023-02-15 12:39:15,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:39:15" (2/3) ... [2023-02-15 12:39:15,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106327e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:39:15, skipping insertion in model container [2023-02-15 12:39:15,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:39:15" (3/3) ... [2023-02-15 12:39:15,678 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2023-02-15 12:39:15,726 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 12:39:15,727 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 12:39:15,808 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 12:39:15,821 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;@4387af32, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 12:39:15,822 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 12:39:15,826 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-15 12:39:15,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 12:39:15,832 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:39:15,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:39:15,833 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:39:15,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:39:15,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2023-02-15 12:39:15,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:39:15,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613048968] [2023-02-15 12:39:15,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:15,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:39:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:16,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:39:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:16,120 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-15 12:39:16,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:39:16,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613048968] [2023-02-15 12:39:16,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613048968] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:39:16,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:39:16,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 12:39:16,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192274222] [2023-02-15 12:39:16,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:39:16,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:39:16,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:39:16,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:39:16,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:39:16,180 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-15 12:39:16,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:39:16,232 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2023-02-15 12:39:16,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 12:39:16,234 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-15 12:39:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:39:16,242 INFO L225 Difference]: With dead ends: 43 [2023-02-15 12:39:16,242 INFO L226 Difference]: Without dead ends: 27 [2023-02-15 12:39:16,244 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-15 12:39:16,247 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-15 12:39:16,248 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-15 12:39:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-15 12:39:16,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-15 12:39:16,279 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-15 12:39:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-02-15 12:39:16,281 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2023-02-15 12:39:16,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:39:16,282 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-02-15 12:39:16,282 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-15 12:39:16,282 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-02-15 12:39:16,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 12:39:16,283 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:39:16,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:39:16,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 12:39:16,284 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:39:16,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:39:16,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2023-02-15 12:39:16,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:39:16,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316307238] [2023-02-15 12:39:16,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:16,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:39:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:16,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:39:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:16,365 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-15 12:39:16,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:39:16,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316307238] [2023-02-15 12:39:16,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316307238] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:39:16,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:39:16,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 12:39:16,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108672276] [2023-02-15 12:39:16,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:39:16,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:39:16,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:39:16,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:39:16,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:39:16,369 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-15 12:39:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:39:16,389 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2023-02-15 12:39:16,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 12:39:16,390 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-15 12:39:16,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:39:16,391 INFO L225 Difference]: With dead ends: 33 [2023-02-15 12:39:16,391 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 12:39:16,392 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-15 12:39:16,393 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-15 12:39:16,393 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-15 12:39:16,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 12:39:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-02-15 12:39:16,400 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-15 12:39:16,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-02-15 12:39:16,402 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2023-02-15 12:39:16,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:39:16,402 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-02-15 12:39:16,402 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-15 12:39:16,403 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-02-15 12:39:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 12:39:16,404 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:39:16,404 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-15 12:39:16,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 12:39:16,404 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:39:16,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:39:16,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2023-02-15 12:39:16,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:39:16,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335834053] [2023-02-15 12:39:16,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:16,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:39:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:16,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:39:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:16,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:16,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 12:39:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:16,586 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-15 12:39:16,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:39:16,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335834053] [2023-02-15 12:39:16,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335834053] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:39:16,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608742836] [2023-02-15 12:39:16,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:16,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:39:16,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:39:16,591 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-15 12:39:16,592 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-15 12:39:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:16,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 12:39:16,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:39:16,748 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-15 12:39:16,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:39:16,996 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-15 12:39:16,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608742836] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:39:16,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:39:16,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2023-02-15 12:39:17,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823655753] [2023-02-15 12:39:17,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:39:17,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 12:39:17,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:39:17,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 12:39:17,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-15 12:39:17,006 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-15 12:39:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:39:17,181 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2023-02-15 12:39:17,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 12:39:17,182 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-15 12:39:17,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:39:17,184 INFO L225 Difference]: With dead ends: 55 [2023-02-15 12:39:17,184 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 12:39:17,185 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-15 12:39:17,186 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-15 12:39:17,187 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-15 12:39:17,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 12:39:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-02-15 12:39:17,193 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-15 12:39:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-02-15 12:39:17,195 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2023-02-15 12:39:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:39:17,195 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-02-15 12:39:17,196 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-15 12:39:17,197 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-02-15 12:39:17,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 12:39:17,198 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:39:17,199 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-15 12:39:17,204 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-15 12:39:17,399 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-15 12:39:17,400 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:39:17,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:39:17,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2023-02-15 12:39:17,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:39:17,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836913915] [2023-02-15 12:39:17,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:17,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:39:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:17,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:39:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:17,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:17,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:17,560 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-15 12:39:17,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:39:17,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836913915] [2023-02-15 12:39:17,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836913915] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:39:17,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686630877] [2023-02-15 12:39:17,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:17,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:39:17,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:39:17,562 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-15 12:39:17,573 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-15 12:39:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:17,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 12:39:17,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:39:17,647 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-15 12:39:17,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:39:17,835 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-15 12:39:17,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686630877] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:39:17,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:39:17,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2023-02-15 12:39:17,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756081293] [2023-02-15 12:39:17,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:39:17,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 12:39:17,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:39:17,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 12:39:17,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-15 12:39:17,838 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-15 12:39:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:39:17,990 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2023-02-15 12:39:17,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 12:39:17,990 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-15 12:39:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:39:17,993 INFO L225 Difference]: With dead ends: 51 [2023-02-15 12:39:17,993 INFO L226 Difference]: Without dead ends: 47 [2023-02-15 12:39:17,993 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-15 12:39:17,994 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-15 12:39:17,995 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-15 12:39:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-15 12:39:18,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-02-15 12:39:18,002 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-15 12:39:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2023-02-15 12:39:18,003 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 24 [2023-02-15 12:39:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:39:18,003 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2023-02-15 12:39:18,004 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-15 12:39:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2023-02-15 12:39:18,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 12:39:18,005 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:39:18,005 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-15 12:39:18,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 12:39:18,210 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-15 12:39:18,210 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:39:18,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:39:18,211 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2023-02-15 12:39:18,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:39:18,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252465574] [2023-02-15 12:39:18,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:18,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:39:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:18,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:39:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:18,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:18,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:18,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 12:39:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:18,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 12:39:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:18,354 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-15 12:39:18,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:39:18,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252465574] [2023-02-15 12:39:18,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252465574] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:39:18,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871568560] [2023-02-15 12:39:18,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:18,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:39:18,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:39:18,358 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-15 12:39:18,361 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-15 12:39:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:18,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 12:39:18,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:39:18,465 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-15 12:39:18,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:39:18,752 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-15 12:39:18,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871568560] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:39:18,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:39:18,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2023-02-15 12:39:18,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240313282] [2023-02-15 12:39:18,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:39:18,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 12:39:18,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:39:18,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 12:39:18,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-02-15 12:39:18,755 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-15 12:39:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:39:18,967 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2023-02-15 12:39:18,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 12:39:18,968 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-15 12:39:18,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:39:18,969 INFO L225 Difference]: With dead ends: 105 [2023-02-15 12:39:18,969 INFO L226 Difference]: Without dead ends: 63 [2023-02-15 12:39:18,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-02-15 12:39:18,971 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-15 12:39:18,972 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-15 12:39:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-15 12:39:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-15 12:39:18,980 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-15 12:39:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2023-02-15 12:39:18,982 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 36 [2023-02-15 12:39:18,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:39:18,982 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2023-02-15 12:39:18,982 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-15 12:39:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2023-02-15 12:39:18,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 12:39:18,984 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:39:18,984 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-15 12:39:18,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 12:39:19,188 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-15 12:39:19,189 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:39:19,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:39:19,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2023-02-15 12:39:19,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:39:19,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302332621] [2023-02-15 12:39:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:19,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:39:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:19,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:39:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:19,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:19,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:19,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:19,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:19,317 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-15 12:39:19,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:39:19,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302332621] [2023-02-15 12:39:19,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302332621] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:39:19,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536608130] [2023-02-15 12:39:19,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:19,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:39:19,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:39:19,319 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-15 12:39:19,348 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-15 12:39:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:19,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 12:39:19,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:39:19,433 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-15 12:39:19,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:39:19,677 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-15 12:39:19,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536608130] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:39:19,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:39:19,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2023-02-15 12:39:19,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931516614] [2023-02-15 12:39:19,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:39:19,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 12:39:19,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:39:19,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 12:39:19,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-02-15 12:39:19,680 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-15 12:39:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:39:19,988 INFO L93 Difference]: Finished difference Result 177 states and 321 transitions. [2023-02-15 12:39:19,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 12:39:19,989 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-15 12:39:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:39:19,996 INFO L225 Difference]: With dead ends: 177 [2023-02-15 12:39:19,996 INFO L226 Difference]: Without dead ends: 117 [2023-02-15 12:39:19,999 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-15 12:39:20,000 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-15 12:39:20,001 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-15 12:39:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-15 12:39:20,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2023-02-15 12:39:20,033 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-15 12:39:20,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2023-02-15 12:39:20,035 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 37 [2023-02-15 12:39:20,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:39:20,035 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2023-02-15 12:39:20,036 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-15 12:39:20,036 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2023-02-15 12:39:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 12:39:20,038 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:39:20,039 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-15 12:39:20,043 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-15 12:39:20,245 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-15 12:39:20,246 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:39:20,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:39:20,246 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2023-02-15 12:39:20,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:39:20,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005554889] [2023-02-15 12:39:20,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:20,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:39:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:20,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:39:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:20,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:20,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:20,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:20,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:20,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:20,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 12:39:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:20,401 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-15 12:39:20,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:39:20,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005554889] [2023-02-15 12:39:20,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005554889] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:39:20,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923216336] [2023-02-15 12:39:20,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:20,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:39:20,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:39:20,403 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-15 12:39:20,428 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-15 12:39:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:20,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 12:39:20,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:39:20,533 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-15 12:39:20,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:39:20,986 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-15 12:39:20,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923216336] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:39:20,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:39:20,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2023-02-15 12:39:20,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897678542] [2023-02-15 12:39:20,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:39:20,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 12:39:20,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:39:20,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 12:39:20,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-02-15 12:39:20,988 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-15 12:39:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:39:21,394 INFO L93 Difference]: Finished difference Result 255 states and 495 transitions. [2023-02-15 12:39:21,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 12:39:21,395 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-15 12:39:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:39:21,397 INFO L225 Difference]: With dead ends: 255 [2023-02-15 12:39:21,397 INFO L226 Difference]: Without dead ends: 155 [2023-02-15 12:39:21,398 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-15 12:39:21,399 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 12:39:21,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 227 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 12:39:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-15 12:39:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2023-02-15 12:39:21,426 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-15 12:39:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 177 transitions. [2023-02-15 12:39:21,429 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 177 transitions. Word has length 51 [2023-02-15 12:39:21,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:39:21,429 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 177 transitions. [2023-02-15 12:39:21,429 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-15 12:39:21,430 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 177 transitions. [2023-02-15 12:39:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-02-15 12:39:21,436 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:39:21,437 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-15 12:39:21,445 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-15 12:39:21,641 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-15 12:39:21,641 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:39:21,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:39:21,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1770426885, now seen corresponding path program 1 times [2023-02-15 12:39:21,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:39:21,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808939103] [2023-02-15 12:39:21,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:21,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:39:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:21,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:39:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:21,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:21,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:21,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:21,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:21,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:21,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:21,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:21,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-15 12:39:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:21,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:21,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:21,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:21,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:21,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:21,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:21,924 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-15 12:39:21,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:39:21,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808939103] [2023-02-15 12:39:21,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808939103] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:39:21,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614964528] [2023-02-15 12:39:21,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:21,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:39:21,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:39:21,930 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-15 12:39:21,939 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-15 12:39:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:22,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 12:39:22,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:39:22,131 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-15 12:39:22,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:39:22,886 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-15 12:39:22,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614964528] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:39:22,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:39:22,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2023-02-15 12:39:22,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837522992] [2023-02-15 12:39:22,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:39:22,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 12:39:22,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:39:22,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 12:39:22,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2023-02-15 12:39:22,889 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-15 12:39:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:39:23,397 INFO L93 Difference]: Finished difference Result 240 states and 462 transitions. [2023-02-15 12:39:23,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 12:39:23,398 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-15 12:39:23,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:39:23,400 INFO L225 Difference]: With dead ends: 240 [2023-02-15 12:39:23,400 INFO L226 Difference]: Without dead ends: 107 [2023-02-15 12:39:23,402 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-15 12:39:23,402 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 89 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 12:39:23,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 201 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 12:39:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-15 12:39:23,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2023-02-15 12:39:23,412 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-15 12:39:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2023-02-15 12:39:23,413 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 107 [2023-02-15 12:39:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:39:23,413 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2023-02-15 12:39:23,414 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-15 12:39:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2023-02-15 12:39:23,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-02-15 12:39:23,415 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:39:23,415 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-15 12:39:23,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 12:39:23,621 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-15 12:39:23,621 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:39:23,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:39:23,622 INFO L85 PathProgramCache]: Analyzing trace with hash -222615371, now seen corresponding path program 1 times [2023-02-15 12:39:23,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:39:23,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591607875] [2023-02-15 12:39:23,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:23,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:39:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:39:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-15 12:39:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-02-15 12:39:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 12:39:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:23,960 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-15 12:39:23,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:39:23,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591607875] [2023-02-15 12:39:23,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591607875] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:39:23,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492928599] [2023-02-15 12:39:23,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:23,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:39:23,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:39:23,965 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-15 12:39:23,992 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-15 12:39:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:24,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 12:39:24,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:39:24,179 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-15 12:39:24,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:39:25,304 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-15 12:39:25,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492928599] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:39:25,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:39:25,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 26 [2023-02-15 12:39:25,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106014032] [2023-02-15 12:39:25,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:39:25,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 12:39:25,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:39:25,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 12:39:25,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2023-02-15 12:39:25,306 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-15 12:39:25,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:39:25,777 INFO L93 Difference]: Finished difference Result 214 states and 372 transitions. [2023-02-15 12:39:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 12:39:25,777 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-15 12:39:25,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:39:25,779 INFO L225 Difference]: With dead ends: 214 [2023-02-15 12:39:25,779 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 12:39:25,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 287 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 12:39:25,781 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 75 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 12:39:25,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 208 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 12:39:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 12:39:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2023-02-15 12:39:25,790 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-15 12:39:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2023-02-15 12:39:25,791 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 134 [2023-02-15 12:39:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:39:25,791 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2023-02-15 12:39:25,791 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-15 12:39:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2023-02-15 12:39:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2023-02-15 12:39:25,795 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:39:25,795 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-15 12:39:25,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 12:39:26,000 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-15 12:39:26,000 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:39:26,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:39:26,001 INFO L85 PathProgramCache]: Analyzing trace with hash 12289001, now seen corresponding path program 1 times [2023-02-15 12:39:26,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:39:26,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881593598] [2023-02-15 12:39:26,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:26,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:39:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:39:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-15 12:39:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:26,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-02-15 12:39:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-02-15 12:39:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,113 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-15 12:39:27,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:39:27,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881593598] [2023-02-15 12:39:27,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881593598] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:39:27,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272609650] [2023-02-15 12:39:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:27,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:39:27,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:39:27,117 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-15 12:39:27,127 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-15 12:39:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:27,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 12:39:27,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:39:27,459 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-15 12:39:27,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:39:29,365 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-15 12:39:29,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272609650] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:39:29,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:39:29,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 28 [2023-02-15 12:39:29,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155875767] [2023-02-15 12:39:29,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:39:29,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 12:39:29,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:39:29,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 12:39:29,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2023-02-15 12:39:29,368 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-15 12:39:29,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:39:29,955 INFO L93 Difference]: Finished difference Result 260 states and 447 transitions. [2023-02-15 12:39:29,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 12:39:29,956 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-15 12:39:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:39:29,958 INFO L225 Difference]: With dead ends: 260 [2023-02-15 12:39:29,958 INFO L226 Difference]: Without dead ends: 155 [2023-02-15 12:39:29,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 851 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=342, Invalid=1638, Unknown=0, NotChecked=0, Total=1980 [2023-02-15 12:39:29,960 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 97 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 12:39:29,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 259 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 12:39:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-15 12:39:29,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2023-02-15 12:39:29,971 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-15 12:39:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2023-02-15 12:39:29,974 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 381 [2023-02-15 12:39:29,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:39:29,974 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2023-02-15 12:39:29,974 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-15 12:39:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2023-02-15 12:39:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2023-02-15 12:39:29,981 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:39:29,981 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 25, 25, 22, 22, 15, 15, 15, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 10, 8, 7, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:39:29,991 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-15 12:39:30,191 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-15 12:39:30,192 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:39:30,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:39:30,192 INFO L85 PathProgramCache]: Analyzing trace with hash -854779469, now seen corresponding path program 2 times [2023-02-15 12:39:30,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:39:30,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509507555] [2023-02-15 12:39:30,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:30,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:39:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:30,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:39:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:30,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:30,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:30,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-02-15 12:39:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-02-15 12:39:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-02-15 12:39:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:39:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 245 proven. 607 refuted. 0 times theorem prover too weak. 3234 trivial. 0 not checked. [2023-02-15 12:39:31,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:39:31,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509507555] [2023-02-15 12:39:31,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509507555] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:39:31,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144644061] [2023-02-15 12:39:31,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 12:39:31,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:39:31,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:39:31,265 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-15 12:39:31,296 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-15 12:39:31,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 12:39:31,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 12:39:31,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 12:39:31,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:39:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 139 proven. 904 refuted. 0 times theorem prover too weak. 3043 trivial. 0 not checked. [2023-02-15 12:39:31,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:39:34,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 139 proven. 937 refuted. 0 times theorem prover too weak. 3010 trivial. 0 not checked. [2023-02-15 12:39:34,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144644061] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:39:34,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:39:34,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 19] total 30 [2023-02-15 12:39:34,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301398147] [2023-02-15 12:39:34,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:39:34,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 12:39:34,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:39:34,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 12:39:34,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2023-02-15 12:39:34,078 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-15 12:39:34,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:39:34,743 INFO L93 Difference]: Finished difference Result 334 states and 594 transitions. [2023-02-15 12:39:34,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-15 12:39:34,744 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 378 [2023-02-15 12:39:34,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:39:34,746 INFO L225 Difference]: With dead ends: 334 [2023-02-15 12:39:34,746 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 12:39:34,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 899 GetRequests, 843 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-15 12:39:34,748 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 123 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 12:39:34,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 221 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 12:39:34,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 12:39:34,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 173. [2023-02-15 12:39:34,763 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-15 12:39:34,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 272 transitions. [2023-02-15 12:39:34,765 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 272 transitions. Word has length 378 [2023-02-15 12:39:34,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:39:34,766 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 272 transitions. [2023-02-15 12:39:34,766 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-15 12:39:34,766 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 272 transitions. [2023-02-15 12:39:34,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2023-02-15 12:39:34,774 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:39:34,774 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 40, 40, 33, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:39:34,783 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-15 12:39:34,980 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-15 12:39:34,981 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:39:34,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:39:34,981 INFO L85 PathProgramCache]: Analyzing trace with hash -557750618, now seen corresponding path program 3 times [2023-02-15 12:39:34,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:39:34,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485497991] [2023-02-15 12:39:34,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:34,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:39:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:35,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:39:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:35,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:39:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-02-15 12:39:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-02-15 12:39:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:39:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2023-02-15 12:39:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:39:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:36,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:37,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:37,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:37,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:37,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8976 backedges. 1515 proven. 1053 refuted. 0 times theorem prover too weak. 6408 trivial. 0 not checked. [2023-02-15 12:39:37,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:39:37,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485497991] [2023-02-15 12:39:37,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485497991] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:39:37,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128178947] [2023-02-15 12:39:37,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 12:39:37,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:39:37,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:39:37,045 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-15 12:39:37,075 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-15 12:39:37,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-15 12:39:37,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 12:39:37,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 12:39:37,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:39:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8976 backedges. 862 proven. 132 refuted. 0 times theorem prover too weak. 7982 trivial. 0 not checked. [2023-02-15 12:39:37,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:39:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8976 backedges. 864 proven. 140 refuted. 0 times theorem prover too weak. 7972 trivial. 0 not checked. [2023-02-15 12:39:38,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128178947] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:39:38,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:39:38,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 10, 13] total 39 [2023-02-15 12:39:38,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443514128] [2023-02-15 12:39:38,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:39:38,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 12:39:38,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:39:38,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 12:39:38,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1280, Unknown=0, NotChecked=0, Total=1482 [2023-02-15 12:39:38,968 INFO L87 Difference]: Start difference. First operand 173 states and 272 transitions. Second operand has 39 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 39 states have internal predecessors, (105), 23 states have call successors, (36), 1 states have call predecessors, (36), 17 states have return successors, (47), 33 states have call predecessors, (47), 23 states have call successors, (47) [2023-02-15 12:39:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:39:39,992 INFO L93 Difference]: Finished difference Result 422 states and 756 transitions. [2023-02-15 12:39:39,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-02-15 12:39:39,993 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 39 states have internal predecessors, (105), 23 states have call successors, (36), 1 states have call predecessors, (36), 17 states have return successors, (47), 33 states have call predecessors, (47), 23 states have call successors, (47) Word has length 556 [2023-02-15 12:39:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:39:39,995 INFO L225 Difference]: With dead ends: 422 [2023-02-15 12:39:39,996 INFO L226 Difference]: Without dead ends: 251 [2023-02-15 12:39:39,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1324 GetRequests, 1257 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1370 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=528, Invalid=3378, Unknown=0, NotChecked=0, Total=3906 [2023-02-15 12:39:39,998 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 108 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 12:39:39,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 556 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 12:39:39,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-02-15 12:39:40,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 229. [2023-02-15 12:39:40,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 165 states have (on average 1.103030303030303) internal successors, (182), 157 states have internal predecessors, (182), 45 states have call successors, (45), 39 states have call predecessors, (45), 18 states have return successors, (103), 32 states have call predecessors, (103), 45 states have call successors, (103) [2023-02-15 12:39:40,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 330 transitions. [2023-02-15 12:39:40,017 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 330 transitions. Word has length 556 [2023-02-15 12:39:40,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:39:40,018 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 330 transitions. [2023-02-15 12:39:40,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 39 states have internal predecessors, (105), 23 states have call successors, (36), 1 states have call predecessors, (36), 17 states have return successors, (47), 33 states have call predecessors, (47), 23 states have call successors, (47) [2023-02-15 12:39:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 330 transitions. [2023-02-15 12:39:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2023-02-15 12:39:40,030 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:39:40,031 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 45, 45, 38, 37, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 22, 22, 22, 22, 16, 13, 10, 8, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:39:40,038 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-15 12:39:40,238 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-15 12:39:40,239 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:39:40,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:39:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash 605724312, now seen corresponding path program 4 times [2023-02-15 12:39:40,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:39:40,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703215939] [2023-02-15 12:39:40,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:39:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:40,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:39:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:39:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 12:39:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:41,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-02-15 12:39:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2023-02-15 12:39:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:39:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 12:39:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:42,262 INFO L134 CoverageAnalysis]: Checked inductivity of 11869 backedges. 595 proven. 1698 refuted. 0 times theorem prover too weak. 9576 trivial. 0 not checked. [2023-02-15 12:39:42,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:39:42,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703215939] [2023-02-15 12:39:42,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703215939] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:39:42,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735356919] [2023-02-15 12:39:42,263 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 12:39:42,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:39:42,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:39:42,264 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-15 12:39:42,293 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-15 12:39:42,523 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 12:39:42,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 12:39:42,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 12:39:42,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:39:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 11869 backedges. 269 proven. 1831 refuted. 0 times theorem prover too weak. 9769 trivial. 0 not checked. [2023-02-15 12:39:42,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:39:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 11869 backedges. 269 proven. 1875 refuted. 0 times theorem prover too weak. 9725 trivial. 0 not checked. [2023-02-15 12:39:45,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735356919] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:39:45,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:39:45,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 21] total 37 [2023-02-15 12:39:45,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52471871] [2023-02-15 12:39:45,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:39:45,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-15 12:39:45,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:39:45,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-15 12:39:45,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 12:39:45,944 INFO L87 Difference]: Start difference. First operand 229 states and 330 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-15 12:39:46,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:39:46,873 INFO L93 Difference]: Finished difference Result 524 states and 838 transitions. [2023-02-15 12:39:46,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-15 12:39:46,874 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 637 [2023-02-15 12:39:46,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:39:46,877 INFO L225 Difference]: With dead ends: 524 [2023-02-15 12:39:46,877 INFO L226 Difference]: Without dead ends: 293 [2023-02-15 12:39:46,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1505 GetRequests, 1435 SyntacticMatches, 10 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=586, Invalid=3196, Unknown=0, NotChecked=0, Total=3782 [2023-02-15 12:39:46,880 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 107 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 12:39:46,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 374 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 12:39:46,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-02-15 12:39:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 261. [2023-02-15 12:39:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 187 states have (on average 1.106951871657754) internal successors, (207), 180 states have internal predecessors, (207), 53 states have call successors, (53), 44 states have call predecessors, (53), 20 states have return successors, (127), 36 states have call predecessors, (127), 53 states have call successors, (127) [2023-02-15 12:39:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 387 transitions. [2023-02-15 12:39:46,901 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 387 transitions. Word has length 637 [2023-02-15 12:39:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:39:46,902 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 387 transitions. [2023-02-15 12:39:46,902 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-15 12:39:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 387 transitions. [2023-02-15 12:39:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2023-02-15 12:39:46,910 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:39:46,911 INFO L195 NwaCegarLoop]: trace histogram [76, 76, 75, 75, 61, 61, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 24, 23, 15, 14, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:39:46,919 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-15 12:39:47,117 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-15 12:39:47,117 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:39:47,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:39:47,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1241761113, now seen corresponding path program 5 times [2023-02-15 12:39:47,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:39:47,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555642792] [2023-02-15 12:39:47,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:47,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:39:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:48,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:39:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:49,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:49,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:39:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 12:39:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-15 12:39:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:39:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2023-02-15 12:39:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:39:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 12:39:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:50,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2023-02-15 12:39:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:39:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 12:39:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:39:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:39:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:39:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:39:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:39:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:39:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 2682 proven. 2990 refuted. 0 times theorem prover too weak. 25964 trivial. 0 not checked. [2023-02-15 12:39:51,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:39:51,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555642792] [2023-02-15 12:39:51,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555642792] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:39:51,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866551555] [2023-02-15 12:39:51,371 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 12:39:51,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:39:51,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:39:51,372 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-15 12:39:51,381 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-15 12:39:51,840 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2023-02-15 12:39:51,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 12:39:51,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 2135 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 12:39:51,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:39:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 3836 proven. 2147 refuted. 0 times theorem prover too weak. 25653 trivial. 0 not checked. [2023-02-15 12:39:52,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:39:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 31636 backedges. 3836 proven. 2201 refuted. 0 times theorem prover too weak. 25599 trivial. 0 not checked. [2023-02-15 12:39:57,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866551555] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:39:57,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:39:57,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 22, 33] total 58 [2023-02-15 12:39:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116406256] [2023-02-15 12:39:57,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:39:57,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-02-15 12:39:57,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:39:57,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-02-15 12:39:57,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=2867, Unknown=0, NotChecked=0, Total=3306 [2023-02-15 12:39:57,324 INFO L87 Difference]: Start difference. First operand 261 states and 387 transitions. Second operand has 58 states, 57 states have (on average 2.7719298245614037) internal successors, (158), 58 states have internal predecessors, (158), 46 states have call successors, (54), 1 states have call predecessors, (54), 22 states have return successors, (74), 36 states have call predecessors, (74), 46 states have call successors, (74) [2023-02-15 12:39:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:39:59,150 INFO L93 Difference]: Finished difference Result 567 states and 921 transitions. [2023-02-15 12:39:59,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-02-15 12:39:59,151 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.7719298245614037) internal successors, (158), 58 states have internal predecessors, (158), 46 states have call successors, (54), 1 states have call predecessors, (54), 22 states have return successors, (74), 36 states have call predecessors, (74), 46 states have call successors, (74) Word has length 1032 [2023-02-15 12:39:59,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:39:59,156 INFO L225 Difference]: With dead ends: 567 [2023-02-15 12:39:59,156 INFO L226 Difference]: Without dead ends: 304 [2023-02-15 12:39:59,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2428 GetRequests, 2324 SyntacticMatches, 16 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3365 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1067, Invalid=6943, Unknown=0, NotChecked=0, Total=8010 [2023-02-15 12:39:59,160 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 193 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 3035 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 3454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 3035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 12:39:59,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 965 Invalid, 3454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 3035 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-15 12:39:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-02-15 12:39:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 254. [2023-02-15 12:39:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 180 states have (on average 1.05) internal successors, (189), 176 states have internal predecessors, (189), 53 states have call successors, (53), 41 states have call predecessors, (53), 20 states have return successors, (133), 36 states have call predecessors, (133), 53 states have call successors, (133) [2023-02-15 12:39:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2023-02-15 12:39:59,180 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 1032 [2023-02-15 12:39:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:39:59,182 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2023-02-15 12:39:59,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.7719298245614037) internal successors, (158), 58 states have internal predecessors, (158), 46 states have call successors, (54), 1 states have call predecessors, (54), 22 states have return successors, (74), 36 states have call predecessors, (74), 46 states have call successors, (74) [2023-02-15 12:39:59,182 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2023-02-15 12:39:59,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1142 [2023-02-15 12:39:59,195 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:39:59,195 INFO L195 NwaCegarLoop]: trace histogram [84, 84, 83, 83, 68, 67, 42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 26, 26, 17, 15, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:39:59,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-15 12:39:59,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-15 12:39:59,403 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:39:59,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:39:59,403 INFO L85 PathProgramCache]: Analyzing trace with hash 604830089, now seen corresponding path program 6 times [2023-02-15 12:39:59,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:39:59,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172552687] [2023-02-15 12:39:59,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:39:59,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:39:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:00,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:40:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:01,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:01,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:01,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:01,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:01,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:01,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:40:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 12:40:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-15 12:40:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:40:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2023-02-15 12:40:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:40:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 12:40:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2023-02-15 12:40:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:40:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 12:40:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-15 12:40:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:02,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:03,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:03,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:03,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:03,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:03,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:03,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:03,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:03,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:03,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:03,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:03,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:03,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:03,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 4425 proven. 3360 refuted. 0 times theorem prover too weak. 30984 trivial. 0 not checked. [2023-02-15 12:40:03,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:40:03,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172552687] [2023-02-15 12:40:03,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172552687] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:40:03,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299339716] [2023-02-15 12:40:03,124 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 12:40:03,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:40:03,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:40:03,128 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-15 12:40:03,129 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-15 12:40:03,572 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2023-02-15 12:40:03,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 12:40:03,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 1802 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 12:40:03,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:40:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 3168 proven. 249 refuted. 0 times theorem prover too weak. 35352 trivial. 0 not checked. [2023-02-15 12:40:03,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:40:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 38769 backedges. 3168 proven. 257 refuted. 0 times theorem prover too weak. 35344 trivial. 0 not checked. [2023-02-15 12:40:06,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299339716] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:40:06,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:40:06,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 14, 17] total 54 [2023-02-15 12:40:06,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704237590] [2023-02-15 12:40:06,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:40:06,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-15 12:40:06,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:40:06,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-15 12:40:06,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=2471, Unknown=0, NotChecked=0, Total=2862 [2023-02-15 12:40:06,831 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand has 54 states, 53 states have (on average 2.5849056603773586) internal successors, (137), 54 states have internal predecessors, (137), 29 states have call successors, (46), 1 states have call predecessors, (46), 22 states have return successors, (62), 47 states have call predecessors, (62), 29 states have call successors, (62) [2023-02-15 12:40:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:40:08,103 INFO L93 Difference]: Finished difference Result 542 states and 832 transitions. [2023-02-15 12:40:08,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-02-15 12:40:08,104 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.5849056603773586) internal successors, (137), 54 states have internal predecessors, (137), 29 states have call successors, (46), 1 states have call predecessors, (46), 22 states have return successors, (62), 47 states have call predecessors, (62), 29 states have call successors, (62) Word has length 1141 [2023-02-15 12:40:08,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:40:08,108 INFO L225 Difference]: With dead ends: 542 [2023-02-15 12:40:08,109 INFO L226 Difference]: Without dead ends: 295 [2023-02-15 12:40:08,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2677 GetRequests, 2594 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2527 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=770, Invalid=5082, Unknown=0, NotChecked=0, Total=5852 [2023-02-15 12:40:08,113 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 203 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 12:40:08,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 788 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2021 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 12:40:08,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-02-15 12:40:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2023-02-15 12:40:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 182 states have (on average 1.032967032967033) internal successors, (188), 178 states have internal predecessors, (188), 53 states have call successors, (53), 42 states have call predecessors, (53), 20 states have return successors, (130), 35 states have call predecessors, (130), 53 states have call successors, (130) [2023-02-15 12:40:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 371 transitions. [2023-02-15 12:40:08,133 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 371 transitions. Word has length 1141 [2023-02-15 12:40:08,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:40:08,135 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 371 transitions. [2023-02-15 12:40:08,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.5849056603773586) internal successors, (137), 54 states have internal predecessors, (137), 29 states have call successors, (46), 1 states have call predecessors, (46), 22 states have return successors, (62), 47 states have call predecessors, (62), 29 states have call successors, (62) [2023-02-15 12:40:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 371 transitions. [2023-02-15 12:40:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1673 [2023-02-15 12:40:08,152 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:40:08,153 INFO L195 NwaCegarLoop]: trace histogram [123, 123, 122, 122, 99, 99, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 38, 38, 24, 23, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:40:08,163 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-15 12:40:08,360 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-15 12:40:08,361 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:40:08,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:40:08,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2019062460, now seen corresponding path program 7 times [2023-02-15 12:40:08,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:40:08,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423358803] [2023-02-15 12:40:08,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:40:08,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:40:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:10,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:40:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:12,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:12,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:40:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 12:40:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-15 12:40:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:40:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2023-02-15 12:40:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:13,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:40:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 12:40:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-15 12:40:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:40:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2023-02-15 12:40:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:40:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 12:40:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1208 [2023-02-15 12:40:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:40:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 12:40:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-15 12:40:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 12:40:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-15 12:40:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:40:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 12:40:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 12:40:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 12:40:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 83878 backedges. 2454 proven. 8124 refuted. 0 times theorem prover too weak. 73300 trivial. 0 not checked. [2023-02-15 12:40:14,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:40:14,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423358803] [2023-02-15 12:40:14,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423358803] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:40:14,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786813685] [2023-02-15 12:40:14,875 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 12:40:14,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:40:14,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:40:14,877 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-15 12:40:14,879 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-15 12:40:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:40:15,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 3736 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 12:40:15,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:40:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 83878 backedges. 2587 proven. 4226 refuted. 0 times theorem prover too weak. 77065 trivial. 0 not checked. [2023-02-15 12:40:15,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:40:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 83878 backedges. 2587 proven. 4278 refuted. 0 times theorem prover too weak. 77013 trivial. 0 not checked. [2023-02-15 12:40:21,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786813685] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:40:21,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:40:21,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 15, 23] total 51 [2023-02-15 12:40:21,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321787682] [2023-02-15 12:40:21,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:40:21,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 12:40:21,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:40:21,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 12:40:21,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2209, Unknown=0, NotChecked=0, Total=2550 [2023-02-15 12:40:21,515 INFO L87 Difference]: Start difference. First operand 256 states and 371 transitions. Second operand has 51 states, 50 states have (on average 2.74) internal successors, (137), 51 states have internal predecessors, (137), 39 states have call successors, (47), 1 states have call predecessors, (47), 22 states have return successors, (68), 38 states have call predecessors, (68), 39 states have call successors, (68) [2023-02-15 12:40:23,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:40:23,362 INFO L93 Difference]: Finished difference Result 645 states and 1112 transitions. [2023-02-15 12:40:23,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-02-15 12:40:23,363 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.74) internal successors, (137), 51 states have internal predecessors, (137), 39 states have call successors, (47), 1 states have call predecessors, (47), 22 states have return successors, (68), 38 states have call predecessors, (68), 39 states have call successors, (68) Word has length 1672 [2023-02-15 12:40:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:40:23,366 INFO L225 Difference]: With dead ends: 645 [2023-02-15 12:40:23,367 INFO L226 Difference]: Without dead ends: 335 [2023-02-15 12:40:23,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3910 GetRequests, 3806 SyntacticMatches, 11 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3317 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1131, Invalid=7799, Unknown=0, NotChecked=0, Total=8930 [2023-02-15 12:40:23,372 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 203 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 2848 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 3334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 2848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 12:40:23,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 733 Invalid, 3334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 2848 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 12:40:23,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-02-15 12:40:23,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 265. [2023-02-15 12:40:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 188 states have (on average 1.0319148936170213) internal successors, (194), 185 states have internal predecessors, (194), 55 states have call successors, (55), 43 states have call predecessors, (55), 21 states have return successors, (110), 36 states have call predecessors, (110), 55 states have call successors, (110) [2023-02-15 12:40:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 359 transitions. [2023-02-15 12:40:23,390 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 359 transitions. Word has length 1672 [2023-02-15 12:40:23,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:40:23,391 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 359 transitions. [2023-02-15 12:40:23,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.74) internal successors, (137), 51 states have internal predecessors, (137), 39 states have call successors, (47), 1 states have call predecessors, (47), 22 states have return successors, (68), 38 states have call predecessors, (68), 39 states have call successors, (68) [2023-02-15 12:40:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 359 transitions. [2023-02-15 12:40:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2023-02-15 12:40:23,401 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:40:23,401 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-15 12:40:23,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 12:40:23,609 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-15 12:40:23,609 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:40:23,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:40:23,610 INFO L85 PathProgramCache]: Analyzing trace with hash -553145382, now seen corresponding path program 8 times [2023-02-15 12:40:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:40:23,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651861630] [2023-02-15 12:40:23,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:40:23,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:40:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 12:40:23,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 12:40:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 12:40:24,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 12:40:24,158 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 12:40:24,159 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 12:40:24,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 12:40:24,165 INFO L445 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:40:24,171 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 12:40:24,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:40:24 BoogieIcfgContainer [2023-02-15 12:40:24,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 12:40:24,328 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 12:40:24,328 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 12:40:24,328 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 12:40:24,329 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:39:15" (3/4) ... [2023-02-15 12:40:24,330 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 12:40:24,462 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 12:40:24,462 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 12:40:24,462 INFO L158 Benchmark]: Toolchain (without parser) took 69206.25ms. Allocated memory was 140.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 92.4MB in the beginning and 962.5MB in the end (delta: -870.1MB). Peak memory consumption was 350.7MB. Max. memory is 16.1GB. [2023-02-15 12:40:24,463 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 140.5MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 12:40:24,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.97ms. Allocated memory is still 140.5MB. Free memory was 92.4MB in the beginning and 82.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 12:40:24,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.21ms. Allocated memory is still 140.5MB. Free memory was 82.3MB in the beginning and 80.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 12:40:24,465 INFO L158 Benchmark]: Boogie Preprocessor took 24.71ms. Allocated memory is still 140.5MB. Free memory was 80.7MB in the beginning and 79.9MB in the end (delta: 834.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 12:40:24,465 INFO L158 Benchmark]: RCFGBuilder took 204.30ms. Allocated memory is still 140.5MB. Free memory was 79.9MB in the beginning and 69.8MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 12:40:24,465 INFO L158 Benchmark]: TraceAbstraction took 68654.98ms. Allocated memory was 140.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 69.4MB in the beginning and 987.5MB in the end (delta: -918.1MB). Peak memory consumption was 302.5MB. Max. memory is 16.1GB. [2023-02-15 12:40:24,465 INFO L158 Benchmark]: Witness Printer took 133.85ms. Allocated memory is still 1.4GB. Free memory was 987.5MB in the beginning and 962.5MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-02-15 12:40:24,468 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 140.5MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 160.97ms. Allocated memory is still 140.5MB. Free memory was 92.4MB in the beginning and 82.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.21ms. Allocated memory is still 140.5MB. Free memory was 82.3MB in the beginning and 80.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.71ms. Allocated memory is still 140.5MB. Free memory was 80.7MB in the beginning and 79.9MB in the end (delta: 834.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 204.30ms. Allocated memory is still 140.5MB. Free memory was 79.9MB in the beginning and 69.8MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 68654.98ms. Allocated memory was 140.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 69.4MB in the beginning and 987.5MB in the end (delta: -918.1MB). Peak memory consumption was 302.5MB. Max. memory is 16.1GB. * Witness Printer took 133.85ms. Allocated memory is still 1.4GB. Free memory was 987.5MB in the beginning and 962.5MB in the end (delta: 25.0MB). 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: 68.4s, OverallIterations: 17, TraceHistogramMax: 123, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.1s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1504 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1419 mSDsluCounter, 5298 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4698 mSDsCounter, 2486 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14907 IncrementalHoareTripleChecker+Invalid, 17393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2486 mSolverCounterUnsat, 600 mSDtfsCounter, 14907 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14722 GetRequests, 13986 SyntacticMatches, 91 SemanticMatches, 645 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13799 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=16, InterpolantAutomatonStates: 480, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 356 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 50.2s InterpolantComputationTime, 13648 NumberOfCodeBlocks, 12754 NumberOfCodeBlocksAsserted, 146 NumberOfCheckSat, 18604 ConstructedInterpolants, 0 QuantifiedInterpolants, 24282 SizeOfPredicates, 102 NumberOfNonLiveVariables, 12015 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 44 InterpolantComputations, 2 PerfectInterpolantSequences, 512323/552549 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-15 12:40:24,507 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