./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann01-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Ackermann01-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93bcf8b6df587e0bc8cb137c6415932ffc9083999b1b09826c5b148989ca1a7b --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 04:18:25,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 04:18:25,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 04:18:25,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 04:18:25,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 04:18:25,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 04:18:25,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 04:18:25,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 04:18:25,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 04:18:25,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 04:18:25,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 04:18:25,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 04:18:25,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 04:18:25,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 04:18:25,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 04:18:25,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 04:18:25,543 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 04:18:25,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 04:18:25,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 04:18:25,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 04:18:25,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 04:18:25,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 04:18:25,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 04:18:25,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 04:18:25,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 04:18:25,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 04:18:25,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 04:18:25,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 04:18:25,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 04:18:25,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 04:18:25,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 04:18:25,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 04:18:25,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 04:18:25,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 04:18:25,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 04:18:25,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 04:18:25,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 04:18:25,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 04:18:25,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 04:18:25,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 04:18:25,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 04:18:25,568 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:18:25,591 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 04:18:25,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 04:18:25,592 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 04:18:25,592 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 04:18:25,593 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 04:18:25,593 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 04:18:25,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 04:18:25,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 04:18:25,593 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 04:18:25,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 04:18:25,594 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 04:18:25,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 04:18:25,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 04:18:25,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 04:18:25,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 04:18:25,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 04:18:25,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 04:18:25,595 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 04:18:25,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 04:18:25,595 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 04:18:25,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 04:18:25,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 04:18:25,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 04:18:25,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 04:18:25,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 04:18:25,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 04:18:25,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 04:18:25,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 04:18:25,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 04:18:25,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 04:18:25,598 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 04:18:25,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 04:18:25,599 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 04:18:25,599 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 04:18:25,599 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 04:18:25,599 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 -> 93bcf8b6df587e0bc8cb137c6415932ffc9083999b1b09826c5b148989ca1a7b [2023-02-18 04:18:25,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 04:18:25,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 04:18:25,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 04:18:25,800 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 04:18:25,801 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 04:18:25,801 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann01-2.c [2023-02-18 04:18:26,913 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 04:18:27,044 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 04:18:27,045 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann01-2.c [2023-02-18 04:18:27,048 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/644d60c1f/5d0bee1c64b342b390f69388dc6b6443/FLAG6eee28ae2 [2023-02-18 04:18:27,058 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/644d60c1f/5d0bee1c64b342b390f69388dc6b6443 [2023-02-18 04:18:27,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 04:18:27,060 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 04:18:27,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 04:18:27,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 04:18:27,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 04:18:27,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:18:27" (1/1) ... [2023-02-18 04:18:27,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66ec121d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:18:27, skipping insertion in model container [2023-02-18 04:18:27,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:18:27" (1/1) ... [2023-02-18 04:18:27,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 04:18:27,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 04:18:27,175 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/Ackermann01-2.c[1234,1247] [2023-02-18 04:18:27,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 04:18:27,183 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 04:18:27,192 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/Ackermann01-2.c[1234,1247] [2023-02-18 04:18:27,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 04:18:27,200 INFO L208 MainTranslator]: Completed translation [2023-02-18 04:18:27,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:18:27 WrapperNode [2023-02-18 04:18:27,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 04:18:27,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 04:18:27,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 04:18:27,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 04:18:27,205 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:18:27" (1/1) ... [2023-02-18 04:18:27,212 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:18:27" (1/1) ... [2023-02-18 04:18:27,221 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2023-02-18 04:18:27,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 04:18:27,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 04:18:27,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 04:18:27,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 04:18:27,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:18:27" (1/1) ... [2023-02-18 04:18:27,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:18:27" (1/1) ... [2023-02-18 04:18:27,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:18:27" (1/1) ... [2023-02-18 04:18:27,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:18:27" (1/1) ... [2023-02-18 04:18:27,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:18:27" (1/1) ... [2023-02-18 04:18:27,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:18:27" (1/1) ... [2023-02-18 04:18:27,231 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:18:27" (1/1) ... [2023-02-18 04:18:27,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:18:27" (1/1) ... [2023-02-18 04:18:27,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 04:18:27,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 04:18:27,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 04:18:27,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 04:18:27,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:18:27" (1/1) ... [2023-02-18 04:18:27,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 04:18:27,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:18:27,259 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:18:27,263 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:18:27,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 04:18:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 04:18:27,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 04:18:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2023-02-18 04:18:27,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2023-02-18 04:18:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 04:18:27,322 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 04:18:27,324 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 04:18:27,421 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 04:18:27,425 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 04:18:27,434 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-18 04:18:27,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:18:27 BoogieIcfgContainer [2023-02-18 04:18:27,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 04:18:27,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 04:18:27,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 04:18:27,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 04:18:27,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 04:18:27" (1/3) ... [2023-02-18 04:18:27,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7489af2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:18:27, skipping insertion in model container [2023-02-18 04:18:27,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:18:27" (2/3) ... [2023-02-18 04:18:27,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7489af2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:18:27, skipping insertion in model container [2023-02-18 04:18:27,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:18:27" (3/3) ... [2023-02-18 04:18:27,465 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2023-02-18 04:18:27,476 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 04:18:27,476 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 04:18:27,524 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 04:18:27,541 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;@69152450, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 04:18:27,541 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 04:18:27,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 04:18:27,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 04:18:27,562 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:18:27,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:18:27,563 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:18:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:18:27,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1470704041, now seen corresponding path program 1 times [2023-02-18 04:18:27,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:18:27,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729960966] [2023-02-18 04:18:27,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:18:27,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:18:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:27,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-18 04:18:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:27,907 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:18:27,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:18:27,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729960966] [2023-02-18 04:18:27,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729960966] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:18:27,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:18:27,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 04:18:27,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955400816] [2023-02-18 04:18:27,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:18:27,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 04:18:27,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:18:27,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 04:18:27,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 04:18:27,949 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:18:28,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:18:28,066 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2023-02-18 04:18:28,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 04:18:28,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:18:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:18:28,074 INFO L225 Difference]: With dead ends: 38 [2023-02-18 04:18:28,074 INFO L226 Difference]: Without dead ends: 22 [2023-02-18 04:18:28,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-18 04:18:28,081 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:18:28,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 88 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:18:28,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-18 04:18:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-18 04:18:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-18 04:18:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-02-18 04:18:28,108 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 12 [2023-02-18 04:18:28,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:18:28,109 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-02-18 04:18:28,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:18:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-02-18 04:18:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 04:18:28,110 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:18:28,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:18:28,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 04:18:28,111 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:18:28,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:18:28,111 INFO L85 PathProgramCache]: Analyzing trace with hash 941922339, now seen corresponding path program 1 times [2023-02-18 04:18:28,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:18:28,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515027495] [2023-02-18 04:18:28,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:18:28,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:18:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:28,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-18 04:18:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:28,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:18:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:18:28,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:18:28,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515027495] [2023-02-18 04:18:28,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515027495] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:18:28,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:18:28,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 04:18:28,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040695451] [2023-02-18 04:18:28,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:18:28,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 04:18:28,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:18:28,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 04:18:28,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-18 04:18:28,225 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:18:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:18:28,312 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2023-02-18 04:18:28,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 04:18:28,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-02-18 04:18:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:18:28,314 INFO L225 Difference]: With dead ends: 29 [2023-02-18 04:18:28,314 INFO L226 Difference]: Without dead ends: 25 [2023-02-18 04:18:28,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-02-18 04:18:28,319 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:18:28,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 68 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:18:28,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-18 04:18:28,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-02-18 04:18:28,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-18 04:18:28,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-02-18 04:18:28,329 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 19 [2023-02-18 04:18:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:18:28,329 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-02-18 04:18:28,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:18:28,329 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-02-18 04:18:28,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-18 04:18:28,331 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:18:28,331 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:18:28,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 04:18:28,332 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:18:28,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:18:28,333 INFO L85 PathProgramCache]: Analyzing trace with hash -445405100, now seen corresponding path program 1 times [2023-02-18 04:18:28,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:18:28,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535809561] [2023-02-18 04:18:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:18:28,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:18:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:28,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-18 04:18:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:28,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:18:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:28,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 04:18:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:28,443 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:18:28,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:18:28,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535809561] [2023-02-18 04:18:28,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535809561] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:18:28,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546719196] [2023-02-18 04:18:28,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:18:28,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:18:28,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:18:28,462 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:18:28,464 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:18:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:28,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 04:18:28,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:18:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-18 04:18:28,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:18:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-18 04:18:28,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546719196] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:18:28,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:18:28,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12 [2023-02-18 04:18:28,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522165818] [2023-02-18 04:18:28,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:18:28,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 04:18:28,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:18:28,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 04:18:28,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-18 04:18:28,616 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-18 04:18:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:18:28,680 INFO L93 Difference]: Finished difference Result 48 states and 75 transitions. [2023-02-18 04:18:28,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 04:18:28,680 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) Word has length 25 [2023-02-18 04:18:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:18:28,682 INFO L225 Difference]: With dead ends: 48 [2023-02-18 04:18:28,682 INFO L226 Difference]: Without dead ends: 30 [2023-02-18 04:18:28,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-02-18 04:18:28,683 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:18:28,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 85 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:18:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-18 04:18:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2023-02-18 04:18:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 04:18:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-02-18 04:18:28,688 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 25 [2023-02-18 04:18:28,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:18:28,694 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-02-18 04:18:28,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-18 04:18:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-02-18 04:18:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-18 04:18:28,696 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:18:28,697 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:18:28,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 04:18:28,901 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:18:28,902 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:18:28,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:18:28,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1893657534, now seen corresponding path program 1 times [2023-02-18 04:18:28,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:18:28,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111082512] [2023-02-18 04:18:28,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:18:28,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:18:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:29,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-18 04:18:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:29,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:18:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:29,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:18:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:29,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-18 04:18:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:18:29,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:18:29,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111082512] [2023-02-18 04:18:29,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111082512] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:18:29,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485510246] [2023-02-18 04:18:29,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:18:29,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:18:29,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:18:29,146 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:18:29,164 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:18:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:29,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 04:18:29,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:18:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-18 04:18:29,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:18:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:18:29,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485510246] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:18:29,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:18:29,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 25 [2023-02-18 04:18:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394928813] [2023-02-18 04:18:29,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:18:29,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-18 04:18:29,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:18:29,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-18 04:18:29,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2023-02-18 04:18:29,461 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 25 states, 25 states have (on average 1.48) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-18 04:18:29,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:18:29,812 INFO L93 Difference]: Finished difference Result 57 states and 97 transitions. [2023-02-18 04:18:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-18 04:18:29,813 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) Word has length 32 [2023-02-18 04:18:29,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:18:29,815 INFO L225 Difference]: With dead ends: 57 [2023-02-18 04:18:29,815 INFO L226 Difference]: Without dead ends: 51 [2023-02-18 04:18:29,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=1443, Unknown=0, NotChecked=0, Total=1722 [2023-02-18 04:18:29,816 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 63 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:18:29,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 164 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:18:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-18 04:18:29,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2023-02-18 04:18:29,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (31), 10 states have call predecessors, (31), 6 states have call successors, (31) [2023-02-18 04:18:29,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2023-02-18 04:18:29,827 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 32 [2023-02-18 04:18:29,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:18:29,828 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2023-02-18 04:18:29,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-18 04:18:29,828 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2023-02-18 04:18:29,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 04:18:29,829 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:18:29,829 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:18:29,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-18 04:18:30,033 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:18:30,034 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:18:30,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:18:30,034 INFO L85 PathProgramCache]: Analyzing trace with hash 372648096, now seen corresponding path program 2 times [2023-02-18 04:18:30,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:18:30,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305403334] [2023-02-18 04:18:30,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:18:30,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:18:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:30,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-18 04:18:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:30,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:18:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:30,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:18:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:30,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:18:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:30,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-18 04:18:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:30,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:18:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-18 04:18:30,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:18:30,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305403334] [2023-02-18 04:18:30,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305403334] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:18:30,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885792735] [2023-02-18 04:18:30,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 04:18:30,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:18:30,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:18:30,157 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:18:30,159 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:18:30,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 04:18:30,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:18:30,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 04:18:30,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:18:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-18 04:18:30,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:18:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-18 04:18:30,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885792735] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:18:30,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:18:30,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 19 [2023-02-18 04:18:30,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232001435] [2023-02-18 04:18:30,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:18:30,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 04:18:30,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:18:30,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 04:18:30,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2023-02-18 04:18:30,339 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 17 states have internal predecessors, (45), 6 states have call successors, (8), 1 states have call predecessors, (8), 10 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2023-02-18 04:18:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:18:30,526 INFO L93 Difference]: Finished difference Result 96 states and 220 transitions. [2023-02-18 04:18:30,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 04:18:30,527 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 17 states have internal predecessors, (45), 6 states have call successors, (8), 1 states have call predecessors, (8), 10 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) Word has length 46 [2023-02-18 04:18:30,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:18:30,528 INFO L225 Difference]: With dead ends: 96 [2023-02-18 04:18:30,528 INFO L226 Difference]: Without dead ends: 63 [2023-02-18 04:18:30,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2023-02-18 04:18:30,530 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 60 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:18:30,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 118 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:18:30,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-18 04:18:30,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2023-02-18 04:18:30,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 11 states have return successors, (57), 17 states have call predecessors, (57), 9 states have call successors, (57) [2023-02-18 04:18:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 107 transitions. [2023-02-18 04:18:30,554 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 107 transitions. Word has length 46 [2023-02-18 04:18:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:18:30,554 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 107 transitions. [2023-02-18 04:18:30,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 17 states have internal predecessors, (45), 6 states have call successors, (8), 1 states have call predecessors, (8), 10 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2023-02-18 04:18:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 107 transitions. [2023-02-18 04:18:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-18 04:18:30,556 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:18:30,557 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 8, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:18:30,566 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:18:30,761 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:18:30,762 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 04:18:30,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:18:30,762 INFO L85 PathProgramCache]: Analyzing trace with hash -558645120, now seen corresponding path program 3 times [2023-02-18 04:18:30,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:18:30,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917830446] [2023-02-18 04:18:30,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:18:30,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:18:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:30,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-18 04:18:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:30,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:18:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:30,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:18:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:31,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:18:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:31,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:18:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:31,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:18:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:31,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-18 04:18:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:31,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-18 04:18:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:31,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:18:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:31,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:18:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:31,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 04:18:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-18 04:18:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:18:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 136 proven. 61 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-02-18 04:18:31,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:18:31,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917830446] [2023-02-18 04:18:31,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917830446] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:18:31,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982264664] [2023-02-18 04:18:31,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 04:18:31,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:18:31,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:18:31,106 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:18:31,108 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:18:31,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-18 04:18:31,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:18:31,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-18 04:18:31,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:18:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 112 proven. 20 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-02-18 04:18:31,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:18:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 133 proven. 2 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-02-18 04:18:31,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982264664] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:18:31,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:18:31,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 14] total 32 [2023-02-18 04:18:31,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098309625] [2023-02-18 04:18:31,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:18:31,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-18 04:18:31,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:18:31,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-18 04:18:31,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2023-02-18 04:18:31,514 INFO L87 Difference]: Start difference. First operand 60 states and 107 transitions. Second operand has 32 states, 32 states have (on average 1.9375) internal successors, (62), 24 states have internal predecessors, (62), 6 states have call successors, (11), 1 states have call predecessors, (11), 14 states have return successors, (26), 19 states have call predecessors, (26), 6 states have call successors, (26) [2023-02-18 04:18:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:18:32,204 INFO L93 Difference]: Finished difference Result 153 states and 443 transitions. [2023-02-18 04:18:32,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-18 04:18:32,204 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 24 states have internal predecessors, (62), 6 states have call successors, (11), 1 states have call predecessors, (11), 14 states have return successors, (26), 19 states have call predecessors, (26), 6 states have call successors, (26) Word has length 86 [2023-02-18 04:18:32,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:18:32,205 INFO L225 Difference]: With dead ends: 153 [2023-02-18 04:18:32,205 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 04:18:32,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 173 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=643, Invalid=3517, Unknown=0, NotChecked=0, Total=4160 [2023-02-18 04:18:32,207 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 110 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 04:18:32,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 173 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 04:18:32,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 04:18:32,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 04:18:32,208 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:18:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 04:18:32,209 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2023-02-18 04:18:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:18:32,209 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 04:18:32,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 24 states have internal predecessors, (62), 6 states have call successors, (11), 1 states have call predecessors, (11), 14 states have return successors, (26), 19 states have call predecessors, (26), 6 states have call successors, (26) [2023-02-18 04:18:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 04:18:32,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 04:18:32,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 04:18:32,218 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:18:32,415 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:18:32,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 04:18:32,428 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 04:18:32,428 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 04:18:32,428 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2023-02-18 04:18:32,428 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 04:18:32,428 INFO L902 garLoopResultBuilder]: At program point L28(lines 28 48) the Hoare annotation is: true [2023-02-18 04:18:32,429 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 46) no Hoare annotation was computed. [2023-02-18 04:18:32,429 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-02-18 04:18:32,429 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-02-18 04:18:32,429 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (<= 0 |ULTIMATE.start_main_~n~0#1|) [2023-02-18 04:18:32,429 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 04:18:32,429 INFO L899 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2023-02-18 04:18:32,429 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 41) no Hoare annotation was computed. [2023-02-18 04:18:32,429 INFO L899 garLoopResultBuilder]: For program point ackermannEXIT(lines 17 25) no Hoare annotation was computed. [2023-02-18 04:18:32,435 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (let ((.cse4 (= ackermann_~m |ackermann_#in~m|))) (let ((.cse1 (<= 0 (+ ackermann_~m (- 1)))) (.cse5 (not (<= 0 (+ (- 1) |ackermann_#in~m|)))) (.cse2 (let ((.cse7 (= ackermann_~n |ackermann_#in~n|))) (let ((.cse6 (let ((.cse8 (not (= ackermann_~m 0))) (.cse9 (or (and (not (= ackermann_~n 1)) .cse7) (= (+ ackermann_~n (- 1)) 0)))) (or (and .cse8 .cse9 .cse7 .cse4) (and .cse8 (<= 0 |ackermann_#in~m|) .cse9 .cse7 .cse4))))) (or (and .cse6 .cse7) (and (or (<= 0 (+ |ackermann_#res| (- 2))) (not (= |ackermann_#in~n| 1))) .cse6 .cse7))))) (.cse3 (>= ackermann_~n |ackermann_#in~n|))) (and (let ((.cse0 (<= |ackermann_#in~m| 1))) (or (not .cse0) (and .cse1 .cse2 (<= ackermann_~m 2) .cse3 .cse4 .cse0) .cse5)) (or (and .cse1 .cse2 .cse3 .cse4) .cse5) .cse2 .cse3 .cse4 (not (= |ackermann_#in~m| 0))))) [2023-02-18 04:18:32,435 INFO L899 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2023-02-18 04:18:32,437 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (let ((.cse0 (or (<= 0 (+ |ackermann_#res| (- 2))) (not (= |ackermann_#in~n| 1)))) (.cse4 (= ackermann_~m |ackermann_#in~m|)) (.cse2 (= ackermann_~n |ackermann_#in~n|))) (let ((.cse7 (not (= |ackermann_#in~m| 0))) (.cse8 (<= 0 (+ ackermann_~m (- 1)))) (.cse1 (or (< (- 2) |ackermann_#res|) (not (>= |ackermann_#in~n| 1)))) (.cse3 (>= ackermann_~n |ackermann_#in~n|)) (.cse5 (let ((.cse11 (not (= ackermann_~m 0))) (.cse12 (or (and (not (= ackermann_~n 1)) .cse2) (= (+ ackermann_~n (- 1)) 0)))) (or (and .cse11 .cse0 .cse12 .cse2 .cse4) (and .cse11 (<= 0 |ackermann_#in~m|) .cse0 .cse12 .cse2 .cse4)))) (.cse9 (not (<= 0 (+ (- 1) |ackermann_#in~m|)))) (.cse6 (<= |ackermann_#in~n| 0))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) .cse0 .cse1 .cse2 (or (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse9) .cse3 .cse4 .cse7 .cse5 (let ((.cse10 (<= |ackermann_#in~m| 1))) (or (not .cse10) (and .cse8 .cse0 .cse1 .cse2 (<= ackermann_~m 2) .cse3 .cse4 .cse10 .cse5 .cse6) .cse9)) .cse6))) [2023-02-18 04:18:32,438 INFO L895 garLoopResultBuilder]: At program point L24-2(line 24) the Hoare annotation is: (let ((.cse27 (* (- 1) |ackermann_#in~m|)) (.cse13 (= ackermann_~n |ackermann_#in~n|))) (let ((.cse10 (not (= ackermann_~m 0))) (.cse11 (<= 0 |ackermann_#in~m|)) (.cse12 (or (and (not (= ackermann_~n 1)) .cse13) (= (+ ackermann_~n (- 1)) 0))) (.cse14 (<= 0 (+ (- 1) |ackermann_#in~m|))) (.cse15 (<= 0 (+ .cse27 1))) (.cse24 (<= 0 (+ |ackermann_#t~ret5| (- 2)))) (.cse16 (>= ackermann_~n |ackermann_#in~n|)) (.cse23 (<= 2 |ackermann_#t~ret5|)) (.cse17 (= ackermann_~m |ackermann_#in~m|)) (.cse19 (<= ackermann_~m 1))) (let ((.cse26 (<= 0 (+ .cse27 2))) (.cse9 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse24 .cse16 .cse23 .cse17 .cse19)) (.cse20 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse19)) (.cse25 (<= ackermann_~m 2)) (.cse0 (<= |ackermann_#in~m| 1)) (.cse21 (<= 0 (+ ackermann_~m (- 1)))) (.cse22 (<= 0 (+ |ackermann_#in~m| (- 2)))) (.cse18 (< (- 2) |ackermann_#t~ret5|))) (let ((.cse2 (not .cse14)) (.cse3 (and .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse22 .cse16 .cse23 .cse17 .cse18)) (.cse1 (and (or .cse9 .cse20) .cse21 .cse25 .cse16 .cse23 .cse17 .cse0)) (.cse4 (and .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse22 .cse24 .cse25 .cse16 .cse23 .cse26 .cse17)) (.cse5 (and .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse22 .cse25 .cse16 .cse26 .cse17 .cse18)) (.cse6 (and .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse22 .cse24 .cse16 .cse23 .cse17)) (.cse7 (and .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse22 .cse16 .cse23 .cse17)) (.cse8 (and .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse22 .cse16 .cse17 .cse18))) (and (or (not .cse0) .cse1 .cse2) (or .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse3 .cse1 .cse4 .cse5 .cse6 .cse2 .cse7 .cse8) (or .cse3 .cse1 .cse4 .cse9 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse5 .cse6 .cse20 .cse7 .cse8) (not (= |ackermann_#in~m| 0))))))) [2023-02-18 04:18:32,438 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 23) no Hoare annotation was computed. [2023-02-18 04:18:32,438 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-02-18 04:18:32,438 INFO L899 garLoopResultBuilder]: For program point L24-3(line 24) no Hoare annotation was computed. [2023-02-18 04:18:32,439 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-02-18 04:18:32,439 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 25) the Hoare annotation is: true [2023-02-18 04:18:32,439 INFO L899 garLoopResultBuilder]: For program point ackermannFINAL(lines 17 25) no Hoare annotation was computed. [2023-02-18 04:18:32,441 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-02-18 04:18:32,442 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 04:18:32,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 04:18:32 BoogieIcfgContainer [2023-02-18 04:18:32,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 04:18:32,448 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 04:18:32,448 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 04:18:32,448 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 04:18:32,449 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:18:27" (3/4) ... [2023-02-18 04:18:32,451 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 04:18:32,454 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2023-02-18 04:18:32,458 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-18 04:18:32,458 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-02-18 04:18:32,458 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 04:18:32,459 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 04:18:32,481 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 04:18:32,481 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 04:18:32,482 INFO L158 Benchmark]: Toolchain (without parser) took 5421.32ms. Allocated memory was 138.4MB in the beginning and 209.7MB in the end (delta: 71.3MB). Free memory was 102.3MB in the beginning and 159.4MB in the end (delta: -57.1MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2023-02-18 04:18:32,482 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory was 85.1MB in the beginning and 84.9MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:18:32,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 139.33ms. Allocated memory is still 138.4MB. Free memory was 101.8MB in the beginning and 91.9MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-18 04:18:32,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.29ms. Allocated memory is still 138.4MB. Free memory was 91.9MB in the beginning and 90.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 04:18:32,482 INFO L158 Benchmark]: Boogie Preprocessor took 10.87ms. Allocated memory is still 138.4MB. Free memory was 90.8MB in the beginning and 89.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:18:32,483 INFO L158 Benchmark]: RCFGBuilder took 209.92ms. Allocated memory is still 138.4MB. Free memory was 89.8MB in the beginning and 78.7MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 04:18:32,483 INFO L158 Benchmark]: TraceAbstraction took 5003.55ms. Allocated memory was 138.4MB in the beginning and 209.7MB in the end (delta: 71.3MB). Free memory was 78.2MB in the beginning and 161.5MB in the end (delta: -83.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:18:32,483 INFO L158 Benchmark]: Witness Printer took 33.29ms. Allocated memory is still 209.7MB. Free memory was 161.5MB in the beginning and 159.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 04:18:32,485 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 138.4MB. Free memory was 85.1MB in the beginning and 84.9MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 139.33ms. Allocated memory is still 138.4MB. Free memory was 101.8MB in the beginning and 91.9MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.29ms. Allocated memory is still 138.4MB. Free memory was 91.9MB in the beginning and 90.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 10.87ms. Allocated memory is still 138.4MB. Free memory was 90.8MB in the beginning and 89.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 209.92ms. Allocated memory is still 138.4MB. Free memory was 89.8MB in the beginning and 78.7MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5003.55ms. Allocated memory was 138.4MB in the beginning and 209.7MB in the end (delta: 71.3MB). Free memory was 78.2MB in the beginning and 161.5MB in the end (delta: -83.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 33.29ms. Allocated memory is still 209.7MB. Free memory was 161.5MB in the beginning and 159.4MB 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: 46]: 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, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 315 mSDsluCounter, 696 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 588 mSDsCounter, 385 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1744 IncrementalHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 385 mSolverCounterUnsat, 108 mSDtfsCounter, 1744 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 555 GetRequests, 373 SyntacticMatches, 21 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=5, InterpolantAutomatonStates: 102, 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, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 126 PreInvPairs, 207 NumberOfFragments, 2576 HoareAnnotationTreeSize, 126 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 409 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 1331 SizeOfPredicates, 15 NumberOfNonLiveVariables, 539 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 1166/1303 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: 28]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-18 04:18:32,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE