./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci03.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 be0a584ba9648c80e7a0523ff51ba530f1926c55cecd3c62f2cee05fbbff42e3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 04:19:33,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 04:19:33,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 04:19:34,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 04:19:34,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 04:19:34,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 04:19:34,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 04:19:34,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 04:19:34,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 04:19:34,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 04:19:34,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 04:19:34,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 04:19:34,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 04:19:34,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 04:19:34,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 04:19:34,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 04:19:34,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 04:19:34,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 04:19:34,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 04:19:34,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 04:19:34,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 04:19:34,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 04:19:34,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 04:19:34,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 04:19:34,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 04:19:34,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 04:19:34,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 04:19:34,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 04:19:34,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 04:19:34,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 04:19:34,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 04:19:34,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 04:19:34,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 04:19:34,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 04:19:34,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 04:19:34,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 04:19:34,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 04:19:34,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 04:19:34,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 04:19:34,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 04:19:34,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 04:19:34,030 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 04:19:34,043 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 04:19:34,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 04:19:34,044 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 04:19:34,044 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 04:19:34,045 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 04:19:34,045 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 04:19:34,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 04:19:34,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 04:19:34,046 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 04:19:34,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 04:19:34,046 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 04:19:34,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 04:19:34,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 04:19:34,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 04:19:34,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 04:19:34,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 04:19:34,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 04:19:34,047 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 04:19:34,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 04:19:34,047 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 04:19:34,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 04:19:34,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 04:19:34,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 04:19:34,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 04:19:34,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 04:19:34,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 04:19:34,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 04:19:34,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 04:19:34,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 04:19:34,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 04:19:34,050 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 04:19:34,050 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 04:19:34,050 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 04:19:34,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 04:19:34,051 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 04:19:34,051 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 -> be0a584ba9648c80e7a0523ff51ba530f1926c55cecd3c62f2cee05fbbff42e3 [2023-02-18 04:19:34,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 04:19:34,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 04:19:34,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 04:19:34,261 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 04:19:34,261 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 04:19:34,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci03.c [2023-02-18 04:19:35,320 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 04:19:35,495 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 04:19:35,501 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci03.c [2023-02-18 04:19:35,505 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65172568d/6d0df77118ea4d62b6b7ad5c558c4a5a/FLAG715fec3ee [2023-02-18 04:19:35,883 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65172568d/6d0df77118ea4d62b6b7ad5c558c4a5a [2023-02-18 04:19:35,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 04:19:35,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 04:19:35,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 04:19:35,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 04:19:35,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 04:19:35,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:19:35" (1/1) ... [2023-02-18 04:19:35,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bdada37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:19:35, skipping insertion in model container [2023-02-18 04:19:35,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:19:35" (1/1) ... [2023-02-18 04:19:35,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 04:19:35,903 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 04:19:35,988 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/Fibonacci03.c[788,801] [2023-02-18 04:19:35,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 04:19:35,997 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 04:19:36,006 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/Fibonacci03.c[788,801] [2023-02-18 04:19:36,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 04:19:36,014 INFO L208 MainTranslator]: Completed translation [2023-02-18 04:19:36,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:19:36 WrapperNode [2023-02-18 04:19:36,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 04:19:36,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 04:19:36,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 04:19:36,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 04:19:36,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:19:36" (1/1) ... [2023-02-18 04:19:36,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:19:36" (1/1) ... [2023-02-18 04:19:36,034 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2023-02-18 04:19:36,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 04:19:36,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 04:19:36,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 04:19:36,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 04:19:36,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:19:36" (1/1) ... [2023-02-18 04:19:36,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:19:36" (1/1) ... [2023-02-18 04:19:36,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:19:36" (1/1) ... [2023-02-18 04:19:36,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:19:36" (1/1) ... [2023-02-18 04:19:36,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:19:36" (1/1) ... [2023-02-18 04:19:36,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:19:36" (1/1) ... [2023-02-18 04:19:36,044 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:19:36" (1/1) ... [2023-02-18 04:19:36,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:19:36" (1/1) ... [2023-02-18 04:19:36,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 04:19:36,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 04:19:36,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 04:19:36,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 04:19:36,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:19:36" (1/1) ... [2023-02-18 04:19:36,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 04:19:36,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:19:36,074 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-18 04:19:36,075 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-18 04:19:36,105 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-02-18 04:19:36,105 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-02-18 04:19:36,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 04:19:36,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 04:19:36,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 04:19:36,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 04:19:36,156 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 04:19:36,158 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 04:19:36,243 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 04:19:36,248 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 04:19:36,248 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-18 04:19:36,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:19:36 BoogieIcfgContainer [2023-02-18 04:19:36,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 04:19:36,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 04:19:36,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 04:19:36,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 04:19:36,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 04:19:35" (1/3) ... [2023-02-18 04:19:36,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d49680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:19:36, skipping insertion in model container [2023-02-18 04:19:36,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:19:36" (2/3) ... [2023-02-18 04:19:36,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d49680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:19:36, skipping insertion in model container [2023-02-18 04:19:36,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:19:36" (3/3) ... [2023-02-18 04:19:36,255 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci03.c [2023-02-18 04:19:36,266 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 04:19:36,266 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 04:19:36,296 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 04:19:36,300 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;@26c8dbc0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 04:19:36,301 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 04:19:36,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 04:19:36,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-18 04:19:36,308 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:19:36,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:19:36,309 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:19:36,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:19:36,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1939714822, now seen corresponding path program 1 times [2023-02-18 04:19:36,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:19:36,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334297225] [2023-02-18 04:19:36,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:19:36,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:19:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:36,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:36,473 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-18 04:19:36,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:19:36,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334297225] [2023-02-18 04:19:36,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334297225] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:19:36,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:19:36,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 04:19:36,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410470172] [2023-02-18 04:19:36,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:19:36,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 04:19:36,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:19:36,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 04:19:36,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 04:19:36,498 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-18 04:19:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:19:36,567 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2023-02-18 04:19:36,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 04:19:36,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-18 04:19:36,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:19:36,574 INFO L225 Difference]: With dead ends: 32 [2023-02-18 04:19:36,574 INFO L226 Difference]: Without dead ends: 19 [2023-02-18 04:19:36,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 04:19:36,578 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:19:36,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 52 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:19:36,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-02-18 04:19:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-02-18 04:19:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 04:19:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-02-18 04:19:36,603 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2023-02-18 04:19:36,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:19:36,603 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-02-18 04:19:36,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-18 04:19:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-02-18 04:19:36,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 04:19:36,605 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:19:36,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:19:36,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 04:19:36,605 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:19:36,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:19:36,606 INFO L85 PathProgramCache]: Analyzing trace with hash 692912656, now seen corresponding path program 1 times [2023-02-18 04:19:36,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:19:36,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476334898] [2023-02-18 04:19:36,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:19:36,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:19:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:36,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:36,671 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-18 04:19:36,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:19:36,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476334898] [2023-02-18 04:19:36,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476334898] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:19:36,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:19:36,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 04:19:36,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902789298] [2023-02-18 04:19:36,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:19:36,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 04:19:36,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:19:36,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 04:19:36,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 04:19:36,675 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-18 04:19:36,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:19:36,705 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2023-02-18 04:19:36,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 04:19:36,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2023-02-18 04:19:36,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:19:36,706 INFO L225 Difference]: With dead ends: 25 [2023-02-18 04:19:36,707 INFO L226 Difference]: Without dead ends: 21 [2023-02-18 04:19:36,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 04:19:36,708 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:19:36,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 35 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:19:36,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-18 04:19:36,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-02-18 04:19:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 04:19:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-02-18 04:19:36,713 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2023-02-18 04:19:36,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:19:36,713 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-02-18 04:19:36,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-18 04:19:36,714 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-02-18 04:19:36,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 04:19:36,714 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:19:36,714 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:19:36,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 04:19:36,715 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:19:36,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:19:36,715 INFO L85 PathProgramCache]: Analyzing trace with hash 453332055, now seen corresponding path program 1 times [2023-02-18 04:19:36,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:19:36,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180807605] [2023-02-18 04:19:36,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:19:36,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:19:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:36,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:36,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:36,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 04:19:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:19:36,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:19:36,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180807605] [2023-02-18 04:19:36,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180807605] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:19:36,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672375611] [2023-02-18 04:19:36,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:19:36,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:19:36,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:19:36,855 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-18 04:19:36,856 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-18 04:19:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:36,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 04:19:36,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:19:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:19:36,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:19:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-18 04:19:37,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672375611] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:19:37,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:19:37,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2023-02-18 04:19:37,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342791184] [2023-02-18 04:19:37,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:19:37,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 04:19:37,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:19:37,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 04:19:37,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-02-18 04:19:37,088 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-18 04:19:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:19:37,190 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2023-02-18 04:19:37,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 04:19:37,191 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 24 [2023-02-18 04:19:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:19:37,192 INFO L225 Difference]: With dead ends: 47 [2023-02-18 04:19:37,192 INFO L226 Difference]: Without dead ends: 30 [2023-02-18 04:19:37,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-02-18 04:19:37,193 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:19:37,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 68 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:19:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-18 04:19:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-18 04:19:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-02-18 04:19:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2023-02-18 04:19:37,199 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 24 [2023-02-18 04:19:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:19:37,200 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2023-02-18 04:19:37,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-18 04:19:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2023-02-18 04:19:37,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-18 04:19:37,201 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:19:37,201 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:19:37,209 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-18 04:19:37,406 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-18 04:19:37,407 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:19:37,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:19:37,408 INFO L85 PathProgramCache]: Analyzing trace with hash -872442578, now seen corresponding path program 1 times [2023-02-18 04:19:37,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:19:37,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105068851] [2023-02-18 04:19:37,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:19:37,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:19:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:37,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:37,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:37,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:37,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:37,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:37,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:37,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:37,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:37,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-02-18 04:19:37,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:19:37,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105068851] [2023-02-18 04:19:37,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105068851] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:19:37,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883128920] [2023-02-18 04:19:37,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:19:37,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:19:37,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:19:37,779 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-18 04:19:37,780 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-18 04:19:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:37,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 04:19:37,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:19:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-02-18 04:19:37,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:19:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-18 04:19:38,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883128920] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:19:38,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:19:38,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2023-02-18 04:19:38,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122160715] [2023-02-18 04:19:38,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:19:38,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 04:19:38,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:19:38,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 04:19:38,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-02-18 04:19:38,018 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-02-18 04:19:38,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:19:38,200 INFO L93 Difference]: Finished difference Result 74 states and 124 transitions. [2023-02-18 04:19:38,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 04:19:38,202 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 66 [2023-02-18 04:19:38,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:19:38,208 INFO L225 Difference]: With dead ends: 74 [2023-02-18 04:19:38,208 INFO L226 Difference]: Without dead ends: 45 [2023-02-18 04:19:38,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 136 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2023-02-18 04:19:38,210 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:19:38,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 108 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:19:38,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-18 04:19:38,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-02-18 04:19:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (24), 9 states have call predecessors, (24), 7 states have call successors, (24) [2023-02-18 04:19:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2023-02-18 04:19:38,218 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 66 [2023-02-18 04:19:38,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:19:38,218 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2023-02-18 04:19:38,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-02-18 04:19:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2023-02-18 04:19:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-02-18 04:19:38,222 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:19:38,222 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:19:38,227 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-18 04:19:38,427 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-18 04:19:38,427 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:19:38,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:19:38,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1668610484, now seen corresponding path program 2 times [2023-02-18 04:19:38,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:19:38,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083259684] [2023-02-18 04:19:38,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:19:38,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:19:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:38,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:38,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:38,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:38,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:38,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:38,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:38,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:38,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-18 04:19:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:38,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:38,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:38,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 04:19:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:38,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:38,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:39,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:39,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:39,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-18 04:19:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:39,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:39,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:39,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:39,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:39,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:39,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-18 04:19:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:39,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:39,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2023-02-18 04:19:39,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:19:39,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083259684] [2023-02-18 04:19:39,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083259684] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:19:39,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518013045] [2023-02-18 04:19:39,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 04:19:39,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:19:39,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:19:39,059 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-18 04:19:39,061 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-18 04:19:39,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 04:19:39,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:19:39,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 04:19:39,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:19:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2023-02-18 04:19:39,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:19:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2023-02-18 04:19:39,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518013045] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:19:39,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:19:39,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2023-02-18 04:19:39,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872902382] [2023-02-18 04:19:39,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:19:39,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-18 04:19:39,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:19:39,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-18 04:19:39,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2023-02-18 04:19:39,357 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2023-02-18 04:19:39,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:19:39,621 INFO L93 Difference]: Finished difference Result 116 states and 215 transitions. [2023-02-18 04:19:39,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-18 04:19:39,622 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 172 [2023-02-18 04:19:39,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:19:39,623 INFO L225 Difference]: With dead ends: 116 [2023-02-18 04:19:39,623 INFO L226 Difference]: Without dead ends: 73 [2023-02-18 04:19:39,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 381 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2023-02-18 04:19:39,625 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 82 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:19:39,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 136 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:19:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-18 04:19:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2023-02-18 04:19:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (37), 13 states have call predecessors, (37), 11 states have call successors, (37) [2023-02-18 04:19:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 100 transitions. [2023-02-18 04:19:39,633 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 100 transitions. Word has length 172 [2023-02-18 04:19:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:19:39,633 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 100 transitions. [2023-02-18 04:19:39,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2023-02-18 04:19:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 100 transitions. [2023-02-18 04:19:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2023-02-18 04:19:39,638 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:19:39,638 INFO L195 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:19:39,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 04:19:39,843 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-18 04:19:39,844 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:19:39,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:19:39,844 INFO L85 PathProgramCache]: Analyzing trace with hash 534519633, now seen corresponding path program 3 times [2023-02-18 04:19:39,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:19:39,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490817019] [2023-02-18 04:19:39,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:19:39,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:19:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 04:19:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-18 04:19:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-18 04:19:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:40,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 04:19:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-18 04:19:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 04:19:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-18 04:19:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 924 proven. 2486 refuted. 0 times theorem prover too weak. 8977 trivial. 0 not checked. [2023-02-18 04:19:41,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:19:41,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490817019] [2023-02-18 04:19:41,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490817019] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:19:41,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786561447] [2023-02-18 04:19:41,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 04:19:41,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:19:41,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:19:41,178 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-18 04:19:41,190 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-18 04:19:41,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2023-02-18 04:19:41,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:19:41,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 04:19:41,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:19:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 254 proven. 2070 refuted. 0 times theorem prover too weak. 10063 trivial. 0 not checked. [2023-02-18 04:19:41,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:19:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 254 proven. 2127 refuted. 0 times theorem prover too weak. 10006 trivial. 0 not checked. [2023-02-18 04:19:41,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786561447] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:19:41,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:19:41,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 35 [2023-02-18 04:19:41,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069993963] [2023-02-18 04:19:41,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:19:41,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-18 04:19:41,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:19:41,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-18 04:19:41,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2023-02-18 04:19:41,626 INFO L87 Difference]: Start difference. First operand 63 states and 100 transitions. Second operand has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 25 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (44), 25 states have call predecessors, (44), 25 states have call successors, (44) [2023-02-18 04:19:42,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:19:42,121 INFO L93 Difference]: Finished difference Result 187 states and 400 transitions. [2023-02-18 04:19:42,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-18 04:19:42,123 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 25 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (44), 25 states have call predecessors, (44), 25 states have call successors, (44) Word has length 461 [2023-02-18 04:19:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:19:42,129 INFO L225 Difference]: With dead ends: 187 [2023-02-18 04:19:42,129 INFO L226 Difference]: Without dead ends: 126 [2023-02-18 04:19:42,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1102 GetRequests, 1026 SyntacticMatches, 19 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=830, Invalid=2592, Unknown=0, NotChecked=0, Total=3422 [2023-02-18 04:19:42,133 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 134 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 04:19:42,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 214 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 04:19:42,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-18 04:19:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2023-02-18 04:19:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 74 states have internal predecessors, (86), 20 states have call successors, (20), 15 states have call predecessors, (20), 10 states have return successors, (51), 18 states have call predecessors, (51), 20 states have call successors, (51) [2023-02-18 04:19:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2023-02-18 04:19:42,157 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 461 [2023-02-18 04:19:42,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:19:42,158 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2023-02-18 04:19:42,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 25 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (44), 25 states have call predecessors, (44), 25 states have call successors, (44) [2023-02-18 04:19:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2023-02-18 04:19:42,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2023-02-18 04:19:42,174 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:19:42,174 INFO L195 NwaCegarLoop]: trace histogram [119, 119, 96, 59, 59, 59, 59, 59, 59, 59, 37, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:19:42,194 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-18 04:19:42,380 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-18 04:19:42,380 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:19:42,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:19:42,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1421420755, now seen corresponding path program 4 times [2023-02-18 04:19:42,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:19:42,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651844039] [2023-02-18 04:19:42,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:19:42,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:19:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:43,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 04:19:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-18 04:19:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-18 04:19:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:44,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 04:19:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-18 04:19:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 04:19:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-18 04:19:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2023-02-18 04:19:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 04:19:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-18 04:19:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-18 04:19:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-02-18 04:19:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 04:19:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:45,688 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 4736 proven. 5516 refuted. 0 times theorem prover too weak. 29236 trivial. 0 not checked. [2023-02-18 04:19:45,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:19:45,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651844039] [2023-02-18 04:19:45,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651844039] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:19:45,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099512527] [2023-02-18 04:19:45,689 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 04:19:45,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:19:45,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:19:45,690 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-18 04:19:45,692 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-18 04:19:45,896 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 04:19:45,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:19:45,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-18 04:19:45,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:19:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 3684 proven. 6093 refuted. 0 times theorem prover too weak. 29711 trivial. 0 not checked. [2023-02-18 04:19:46,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:19:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 39488 backedges. 3684 proven. 6240 refuted. 0 times theorem prover too weak. 29564 trivial. 0 not checked. [2023-02-18 04:19:46,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099512527] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:19:46,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:19:46,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21, 35] total 50 [2023-02-18 04:19:46,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120418560] [2023-02-18 04:19:46,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:19:46,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-18 04:19:46,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:19:46,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-18 04:19:46,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1900, Unknown=0, NotChecked=0, Total=2450 [2023-02-18 04:19:46,759 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 50 states, 50 states have (on average 2.72) internal successors, (136), 50 states have internal predecessors, (136), 45 states have call successors, (49), 1 states have call predecessors, (49), 18 states have return successors, (74), 29 states have call predecessors, (74), 45 states have call successors, (74) [2023-02-18 04:19:47,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:19:47,601 INFO L93 Difference]: Finished difference Result 258 states and 509 transitions. [2023-02-18 04:19:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-18 04:19:47,601 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.72) internal successors, (136), 50 states have internal predecessors, (136), 45 states have call successors, (49), 1 states have call predecessors, (49), 18 states have return successors, (74), 29 states have call predecessors, (74), 45 states have call successors, (74) Word has length 815 [2023-02-18 04:19:47,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:19:47,603 INFO L225 Difference]: With dead ends: 258 [2023-02-18 04:19:47,603 INFO L226 Difference]: Without dead ends: 154 [2023-02-18 04:19:47,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1934 GetRequests, 1808 SyntacticMatches, 47 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2966 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1543, Invalid=4937, Unknown=0, NotChecked=0, Total=6480 [2023-02-18 04:19:47,606 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 191 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 745 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 745 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 04:19:47,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 306 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [745 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 04:19:47,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-02-18 04:19:47,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 127. [2023-02-18 04:19:47,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 91 states have (on average 1.032967032967033) internal successors, (94), 88 states have internal predecessors, (94), 25 states have call successors, (25), 20 states have call predecessors, (25), 10 states have return successors, (64), 18 states have call predecessors, (64), 25 states have call successors, (64) [2023-02-18 04:19:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 183 transitions. [2023-02-18 04:19:47,624 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 183 transitions. Word has length 815 [2023-02-18 04:19:47,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:19:47,627 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 183 transitions. [2023-02-18 04:19:47,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.72) internal successors, (136), 50 states have internal predecessors, (136), 45 states have call successors, (49), 1 states have call predecessors, (49), 18 states have return successors, (74), 29 states have call predecessors, (74), 45 states have call successors, (74) [2023-02-18 04:19:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2023-02-18 04:19:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2023-02-18 04:19:47,637 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:19:47,637 INFO L195 NwaCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:19:47,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 04:19:47,844 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-18 04:19:47,844 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:19:47,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:19:47,845 INFO L85 PathProgramCache]: Analyzing trace with hash -425340118, now seen corresponding path program 5 times [2023-02-18 04:19:47,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:19:47,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098674355] [2023-02-18 04:19:47,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:19:47,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:19:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:53,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:55,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:56,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:56,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:56,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:56,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 04:19:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-18 04:19:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-18 04:19:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 04:19:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-02-18 04:19:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 04:19:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-18 04:19:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2023-02-18 04:19:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:57,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 04:19:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-18 04:19:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-18 04:19:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-18 04:19:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 04:19:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:19:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-18 04:19:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:19:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:19:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2023-02-18 04:19:58,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:19:58,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098674355] [2023-02-18 04:19:58,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098674355] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:19:58,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922558047] [2023-02-18 04:19:58,260 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 04:19:58,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:19:58,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:19:58,261 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-18 04:19:58,285 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-18 04:19:58,685 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 93 check-sat command(s) [2023-02-18 04:19:58,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:19:58,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 220 conjunts are in the unsatisfiable core [2023-02-18 04:19:58,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:20:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2023-02-18 04:20:00,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:20:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2023-02-18 04:20:19,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922558047] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:20:19,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:20:19,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 36 [2023-02-18 04:20:19,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324905961] [2023-02-18 04:20:19,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:20:19,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-18 04:20:19,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:20:19,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-18 04:20:19,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2023-02-18 04:20:19,420 INFO L87 Difference]: Start difference. First operand 127 states and 183 transitions. Second operand has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 19 states have internal predecessors, (43), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (24), 24 states have call predecessors, (24), 8 states have call successors, (24) [2023-02-18 04:20:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:20:19,548 INFO L93 Difference]: Finished difference Result 128 states and 184 transitions. [2023-02-18 04:20:19,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-18 04:20:19,549 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 19 states have internal predecessors, (43), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (24), 24 states have call predecessors, (24), 8 states have call successors, (24) Word has length 747 [2023-02-18 04:20:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:20:19,550 INFO L225 Difference]: With dead ends: 128 [2023-02-18 04:20:19,550 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 04:20:19,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1932 GetRequests, 1534 SyntacticMatches, 363 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8728 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=271, Invalid=1061, Unknown=0, NotChecked=0, Total=1332 [2023-02-18 04:20:19,551 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:20:19,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 342 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:20:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 04:20:19,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 04:20:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 04:20:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 04:20:19,552 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 747 [2023-02-18 04:20:19,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:20:19,552 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 04:20:19,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 19 states have internal predecessors, (43), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (24), 24 states have call predecessors, (24), 8 states have call successors, (24) [2023-02-18 04:20:19,552 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 04:20:19,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 04:20:19,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 04:20:19,565 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-18 04:20:19,765 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-18 04:20:19,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 04:20:19,777 INFO L899 garLoopResultBuilder]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2023-02-18 04:20:19,778 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (let ((.cse33 (<= fibonacci_~n 2)) (.cse7 (not (<= (+ (- 1) fibonacci_~n) 0))) (.cse8 (= fibonacci_~n |fibonacci_#in~n|)) (.cse31 (* (- 1) |fibonacci_#in~n|))) (let ((.cse11 (<= .cse31 (- 4))) (.cse5 (<= 3 |fibonacci_#in~n|)) (.cse0 (and .cse33 .cse7 .cse8)) (.cse20 (<= fibonacci_~n 5)) (.cse18 (<= |fibonacci_#in~n| 2)) (.cse29 (< |fibonacci_#in~n| 9))) (let ((.cse2 (not (<= 0 (+ 2 .cse31)))) (.cse1 (and (or .cse0 (and (or (and .cse20 .cse18 .cse7 .cse8) (and .cse20 .cse29 .cse18 .cse7 .cse8)) .cse33 .cse7 .cse8) (and .cse29 .cse33 .cse7 .cse8)) .cse33 .cse7 .cse8)) (.cse19 (<= 0 (+ (- 5) fibonacci_~n))) (.cse21 (not (<= .cse31 (- 5)))) (.cse23 (not (<= 0 (+ 6 .cse31)))) (.cse24 (<= fibonacci_~n 6)) (.cse27 (not (<= 0 (+ 3 .cse31)))) (.cse26 (<= fibonacci_~n 3)) (.cse12 (<= 0 (+ (- 6) fibonacci_~n))) (.cse13 (not (<= .cse31 (- 6)))) (.cse4 (not (<= 0 (+ 4 .cse31)))) (.cse16 (not (<= 0 (+ (- 2) |fibonacci_#in~n|)))) (.cse6 (<= fibonacci_~n 4)) (.cse9 (not .cse5)) (.cse10 (not .cse11)) (.cse22 (not (<= 0 (+ 5 .cse31)))) (.cse30 (and .cse7 .cse8)) (.cse15 (not .cse29)) (.cse25 (not (<= 0 (+ 1 .cse31)))) (.cse3 (not (<= 1 |fibonacci_#in~n|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (and .cse5 .cse6 .cse7 .cse8) .cse9) (or .cse10 (and .cse11 .cse12 .cse7 .cse8) .cse13) (or (let ((.cse14 (let ((.cse17 (not .cse18))) (and .cse17 (or .cse17 .cse15))))) (and (or .cse2 (and (or .cse2 .cse14) (or .cse15 .cse2) .cse2) .cse16) (or .cse2 .cse16 .cse14))) .cse0 .cse1) (or .cse10 (and .cse11 .cse7 .cse8)) (or (and .cse19 .cse20 .cse7 .cse8) (and (or .cse10 .cse21 .cse22) (or .cse21 .cse16 .cse22)) (and .cse19 .cse20 .cse11 .cse7 .cse8)) (or .cse23 .cse21 .cse16 (and .cse19 .cse24 .cse7 .cse8)) (or .cse25 .cse3) (or (and .cse26 .cse7 .cse8) .cse16 .cse27) (or (and .cse19 .cse7 .cse8) .cse21 .cse16) (or .cse23 .cse10 .cse13 (and .cse11 .cse12 .cse24 .cse7 .cse8)) (let ((.cse28 (<= |fibonacci_#in~n| 3))) (or (and (or (and .cse20 .cse26 .cse7 .cse8 .cse28) (and .cse29 .cse26 .cse7 .cse8)) .cse5 .cse26 .cse7 .cse8) (and (or (and (or .cse15 .cse16 .cse27) (or (not .cse28) .cse16 .cse27)) .cse9 .cse27) (or .cse9 .cse27)) (and .cse5 .cse26 .cse7 .cse8))) (or .cse30 .cse16) (or .cse10 (not (<= 0 (+ 7 .cse31))) (and (<= fibonacci_~n 7) .cse11 .cse12 .cse7 .cse8) .cse13) (or (not (<= |fibonacci_#in~n| 0)) .cse15 .cse25) (or (and .cse6 .cse11 .cse7 .cse8) (and (or .cse10 .cse4) (or .cse10 .cse4 .cse15) (or .cse10 .cse4 .cse16)) (and .cse6 .cse29 .cse11 .cse7 .cse8)) (or .cse9 (and .cse5 .cse7 .cse8)) .cse7 .cse8 (or .cse10 (and .cse20 .cse11 .cse7 .cse8) .cse22) (or .cse30 .cse3) (or .cse25 (and (or .cse15 .cse25) (or .cse25 (let ((.cse32 (not (<= |fibonacci_#in~n| 1)))) (and (or .cse25 .cse32) (or .cse15 .cse32) .cse32))) .cse25) .cse3))))) [2023-02-18 04:20:19,778 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-02-18 04:20:19,779 INFO L895 garLoopResultBuilder]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse14 (* (- 1) |fibonacci_#in~n|))) (let ((.cse35 (<= 3 |fibonacci_#in~n|)) (.cse31 (< |fibonacci_#in~n| 9)) (.cse42 (<= .cse14 (- 4)))) (let ((.cse6 (not .cse42)) (.cse22 (not (<= .cse14 (- 5)))) (.cse50 (not (<= 0 (+ 5 .cse14)))) (.cse39 (<= 0 (+ (- 5) fibonacci_~n))) (.cse40 (<= |fibonacci_#in~n| 5)) (.cse45 (<= fibonacci_~n 6)) (.cse52 (<= 0 (+ |fibonacci_#t~ret4| (- 21)))) (.cse46 (<= fibonacci_~n 7)) (.cse47 (<= 7 |fibonacci_#in~n|)) (.cse48 (<= |fibonacci_#in~n| 7)) (.cse27 (<= 8 |fibonacci_#in~n|)) (.cse28 (<= 0 (+ (- 7) fibonacci_~n))) (.cse30 (<= fibonacci_~n 8)) (.cse32 (<= 0 (+ (- 6) fibonacci_~n))) (.cse41 (<= fibonacci_~n 4)) (.cse43 (<= |fibonacci_#in~n| 4)) (.cse44 (<= fibonacci_~n 2)) (.cse26 (<= |fibonacci_#in~n| 2)) (.cse29 (<= 0 (+ (- 3) fibonacci_~n))) (.cse36 (<= fibonacci_~n 5)) (.cse53 (<= 0 (+ (- 1) |fibonacci_#t~ret4|))) (.cse37 (<= fibonacci_~n 3)) (.cse33 (not (<= (+ (- 1) fibonacci_~n) 0))) (.cse34 (= fibonacci_~n |fibonacci_#in~n|)) (.cse8 (not .cse31)) (.cse38 (<= |fibonacci_#in~n| 3)) (.cse2 (not (<= 0 (+ (- 2) |fibonacci_#in~n|)))) (.cse19 (not .cse35)) (.cse3 (not (<= 0 (+ 3 .cse14))))) (let ((.cse1 (and (or (and (or .cse8 .cse2 .cse3) (or (not .cse38) .cse2 .cse3)) .cse19 .cse3) (or .cse19 .cse3))) (.cse11 (not (<= 0 (+ 2 .cse14)))) (.cse7 (not (<= 0 (+ 4 .cse14)))) (.cse0 (and .cse35 .cse29 .cse36 .cse53 .cse37 .cse33 .cse34 .cse38)) (.cse4 (and .cse36 .cse53 .cse31 .cse44 .cse26 .cse33 .cse34)) (.cse49 (not (<= 0 (+ 6 .cse14)))) (.cse5 (and .cse41 (<= 0 (+ (- 2) |fibonacci_#t~ret4|)) .cse29 .cse36 .cse31 .cse42 .cse43 .cse33 .cse34)) (.cse17 (and .cse27 .cse28 (<= 0 (+ (- 13) |fibonacci_#t~ret4|)) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34)) (.cse13 (and .cse28 .cse29 (<= 0 (+ |fibonacci_#t~ret4| (- 8))) .cse46 .cse47 .cse32 .cse48 .cse33 .cse34)) (.cse18 (and .cse27 .cse28 .cse52 .cse29 .cse32 .cse33 .cse34)) (.cse15 (and .cse29 .cse31 (<= 0 (+ |fibonacci_#t~ret4| (- 5))) .cse32 .cse45 .cse33 .cse34)) (.cse16 (not (<= .cse14 (- 6)))) (.cse20 (and .cse27 .cse28 .cse52 .cse29 (<= fibonacci_~n 9) .cse32 .cse33 .cse34)) (.cse9 (and .cse29 .cse39 .cse36 (<= 0 (+ |fibonacci_#t~ret4| (- 3))) .cse33 .cse34 .cse40)) (.cse23 (and .cse36 .cse31 .cse44 .cse26 .cse33 .cse34)) (.cse10 (and (or .cse6 .cse22 .cse50) (or .cse22 .cse2 .cse50))) (.cse21 (not (<= 0 (+ 1 .cse14)))) (.cse12 (not (<= 1 |fibonacci_#in~n|)))) (and (or .cse0 .cse1) (or .cse0 .cse2 .cse3 .cse4) (or .cse5 (and (or .cse6 .cse7) (or .cse6 .cse7 .cse8) (or .cse6 .cse7 .cse2))) (or .cse9 .cse10) (or .cse11 .cse12 .cse4) (or .cse6 .cse13 (not (<= 0 (+ 7 .cse14))) .cse15 .cse16) (or .cse9 .cse5 .cse17 .cse0 .cse13 .cse18 .cse15 .cse19 .cse20) (or .cse21 .cse12) (or .cse9 .cse22 .cse17 .cse13 .cse23 .cse18 .cse15 .cse2 .cse20) (or .cse0 .cse1 .cse23) (or .cse9 .cse5 .cse17 .cse0 .cse13 .cse18 .cse15 .cse12 .cse20 .cse4) (or (let ((.cse24 (let ((.cse25 (not .cse26))) (and .cse25 (or .cse25 .cse8))))) (and (or .cse11 (and (or .cse11 .cse24) (or .cse8 .cse11) .cse11) .cse2) (or .cse11 .cse2 .cse24))) .cse4) (or .cse5 .cse0 .cse7 .cse19) (or .cse9 (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) .cse5 .cse17 (and .cse35 .cse29 .cse36 .cse37 .cse33 .cse34 .cse38) .cse0 .cse13 (and .cse29 .cse39 .cse36 .cse33 .cse34 .cse40) (and .cse31 .cse33 .cse34) (and .cse41 .cse29 .cse36 .cse31 .cse42 .cse43 .cse33 .cse34) (and .cse29 .cse36 .cse33 .cse34 .cse40) .cse23 .cse18 .cse15 (and .cse41 .cse29 .cse36 .cse31 .cse43 .cse33 .cse34) (and .cse29 .cse36 .cse37 .cse33 .cse34 .cse38) (and .cse29 .cse31 .cse32 .cse33 .cse34) (and .cse29 .cse31 .cse33 .cse34) (and .cse31 .cse44 .cse33 .cse34) .cse20 (and .cse29 .cse36 .cse31 .cse43 .cse33 .cse34) .cse4 (and .cse29 .cse31 .cse32 .cse45 .cse33 .cse34) (and .cse28 .cse29 .cse46 .cse47 .cse32 .cse48 .cse33 .cse34) (and .cse29 .cse46 .cse32 .cse48 .cse33 .cse34) (and .cse37 .cse33 .cse34 .cse38)) (or .cse49 .cse9 .cse22 .cse23 .cse15 .cse2) (or (not (<= |fibonacci_#in~n| 0)) .cse8 .cse21) (or .cse9 .cse5 .cse17 .cse0 .cse13 .cse18 .cse15 .cse2 .cse20 .cse4) (or .cse9 .cse5 .cse6 .cse17 .cse13 .cse18 .cse15 .cse20) (or .cse49 .cse6 .cse15 .cse16) (or .cse9 .cse5 .cse6 .cse50) (or .cse6 .cse17 .cse13 .cse18 .cse15 .cse16 .cse20) (or .cse9 .cse23 .cse10) (or .cse21 (and (or .cse8 .cse21) (or .cse21 (let ((.cse51 (not (<= |fibonacci_#in~n| 1)))) (and (or .cse21 .cse51) (or .cse8 .cse51) .cse51))) .cse21) .cse12)))))) [2023-02-18 04:20:19,779 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 23) no Hoare annotation was computed. [2023-02-18 04:20:19,779 INFO L899 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2023-02-18 04:20:19,779 INFO L899 garLoopResultBuilder]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2023-02-18 04:20:19,779 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2023-02-18 04:20:19,780 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 24) the Hoare annotation is: (let ((.cse8 (* (- 1) |fibonacci_#in~n|))) (let ((.cse0 (<= 0 (+ (- 2) |fibonacci_#in~n|))) (.cse2 (<= .cse8 (- 4))) (.cse7 (< |fibonacci_#in~n| 9))) (let ((.cse5 (not .cse7)) (.cse3 (not .cse2)) (.cse6 (not .cse0))) (and (let ((.cse1 (<= 0 (+ 4 .cse8)))) (or (and .cse0 .cse1 .cse2) (let ((.cse4 (not .cse1))) (and (or .cse3 .cse4) (or .cse3 .cse4 .cse5) (or .cse3 .cse4 .cse6))) (and .cse1 .cse2) (and .cse1 .cse7 .cse2))) (let ((.cse14 (<= |fibonacci_#in~n| 2))) (let ((.cse10 (or .cse14 (and .cse7 .cse14))) (.cse9 (<= 0 (+ 2 .cse8)))) (or (and .cse0 .cse9 .cse10) (let ((.cse11 (not .cse9)) (.cse12 (let ((.cse13 (not .cse14))) (and .cse13 (or .cse13 .cse5))))) (and (or .cse11 (and (or .cse11 .cse12) (or .cse5 .cse11) .cse11) .cse6) (or .cse11 .cse6 .cse12))) (and .cse0 (or (and .cse7 .cse9) (and .cse9 .cse10) .cse9) .cse9)))) (let ((.cse16 (<= |fibonacci_#in~n| 3)) (.cse17 (<= 3 |fibonacci_#in~n|)) (.cse15 (<= 0 (+ 3 .cse8)))) (or (and (or (and .cse0 .cse15 .cse7) (and .cse0 .cse15 .cse16)) .cse17 .cse15) (let ((.cse19 (not .cse17)) (.cse18 (not .cse15))) (and (or (and (or .cse5 .cse6 .cse18) (or (not .cse16) .cse6 .cse18)) .cse19 .cse18) (or .cse19 .cse18))) (and .cse17 .cse15))) (let ((.cse21 (<= |fibonacci_#in~n| 1)) (.cse20 (<= 0 (+ 1 .cse8))) (.cse22 (<= 1 |fibonacci_#in~n|))) (or (and .cse20 (or (and .cse20 .cse7) (and .cse20 (or (and .cse7 .cse21) (and .cse20 .cse21) .cse21)) .cse20) .cse22) (let ((.cse23 (not .cse20)) (.cse24 (not .cse22))) (and (or .cse23 .cse24) (or .cse23 (and (or .cse5 .cse23) (or .cse23 (let ((.cse25 (not .cse21))) (and (or .cse23 .cse25) (or .cse5 .cse25) .cse25))) .cse23) .cse24))) (and .cse20 .cse22))) (let ((.cse27 (<= 0 (+ 5 .cse8))) (.cse26 (<= .cse8 (- 5)))) (or (and .cse0 .cse26 .cse27) (and .cse2 .cse26 .cse27) (let ((.cse28 (not .cse26)) (.cse29 (not .cse27))) (and (or .cse3 .cse28 .cse29) (or .cse28 .cse6 .cse29))))))))) [2023-02-18 04:20:19,780 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2023-02-18 04:20:19,780 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 04:20:19,780 INFO L902 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2023-02-18 04:20:19,780 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 04:20:19,780 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2023-02-18 04:20:19,780 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 31) no Hoare annotation was computed. [2023-02-18 04:20:19,780 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 04:20:19,780 INFO L902 garLoopResultBuilder]: At program point L27(lines 27 38) the Hoare annotation is: true [2023-02-18 04:20:19,781 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2023-02-18 04:20:19,781 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 04:20:19,781 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2023-02-18 04:20:19,783 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2023-02-18 04:20:19,784 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 04:20:19,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 04:20:19 BoogieIcfgContainer [2023-02-18 04:20:19,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 04:20:19,800 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 04:20:19,800 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 04:20:19,800 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 04:20:19,801 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:19:36" (3/4) ... [2023-02-18 04:20:19,803 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 04:20:19,807 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2023-02-18 04:20:19,809 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-18 04:20:19,809 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 04:20:19,810 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 04:20:19,810 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 04:20:19,828 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 04:20:19,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 04:20:19,829 INFO L158 Benchmark]: Toolchain (without parser) took 43942.81ms. Allocated memory was 157.3MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 118.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 343.5MB. Max. memory is 16.1GB. [2023-02-18 04:20:19,829 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:20:19,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 128.53ms. Allocated memory is still 157.3MB. Free memory was 118.9MB in the beginning and 109.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 04:20:19,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.39ms. Allocated memory is still 157.3MB. Free memory was 109.0MB in the beginning and 107.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 04:20:19,829 INFO L158 Benchmark]: Boogie Preprocessor took 10.70ms. Allocated memory is still 157.3MB. Free memory was 107.4MB in the beginning and 106.4MB in the end (delta: 972.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:20:19,830 INFO L158 Benchmark]: RCFGBuilder took 203.89ms. Allocated memory is still 157.3MB. Free memory was 106.4MB in the beginning and 122.7MB in the end (delta: -16.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-18 04:20:19,830 INFO L158 Benchmark]: TraceAbstraction took 43549.03ms. Allocated memory was 157.3MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 122.7MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 346.1MB. Max. memory is 16.1GB. [2023-02-18 04:20:19,830 INFO L158 Benchmark]: Witness Printer took 27.98ms. Allocated memory is still 2.1GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 04:20:19,831 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.15ms. Allocated memory is still 113.2MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 128.53ms. Allocated memory is still 157.3MB. Free memory was 118.9MB in the beginning and 109.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.39ms. Allocated memory is still 157.3MB. Free memory was 109.0MB in the beginning and 107.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 10.70ms. Allocated memory is still 157.3MB. Free memory was 107.4MB in the beginning and 106.4MB in the end (delta: 972.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 203.89ms. Allocated memory is still 157.3MB. Free memory was 106.4MB in the beginning and 122.7MB in the end (delta: -16.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 43549.03ms. Allocated memory was 157.3MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 122.7MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 346.1MB. Max. memory is 16.1GB. * Witness Printer took 27.98ms. Allocated memory is still 2.1GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.5s, OverallIterations: 8, TraceHistogramMax: 119, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 516 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 498 mSDsluCounter, 1261 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1059 mSDsCounter, 1223 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2343 IncrementalHoareTripleChecker+Invalid, 3566 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1223 mSolverCounterUnsat, 202 mSDtfsCounter, 2343 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5645 GetRequests, 4938 SyntacticMatches, 449 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13406 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=7, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 57 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 200 PreInvPairs, 301 NumberOfFragments, 5264 HoareAnnotationTreeSize, 200 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 38.5s InterpolantComputationTime, 4593 NumberOfCodeBlocks, 4268 NumberOfCodeBlocksAsserted, 134 NumberOfCheckSat, 6858 ConstructedInterpolants, 0 QuantifiedInterpolants, 15111 SizeOfPredicates, 44 NumberOfNonLiveVariables, 4372 ConjunctsInSsa, 296 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 219410/260316 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-18 04:20:19,847 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 Result: TRUE