./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/Ackermann04.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 85f83c4bcdce9397140788b204098e14e4fa25f5b66f064340f4aaa544fbb462 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 06:21:29,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 06:21:29,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 06:21:29,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 06:21:29,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 06:21:29,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 06:21:29,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 06:21:29,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 06:21:29,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 06:21:29,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 06:21:29,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 06:21:29,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 06:21:29,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 06:21:29,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 06:21:29,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 06:21:29,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 06:21:29,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 06:21:29,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 06:21:29,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 06:21:29,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 06:21:29,368 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 06:21:29,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 06:21:29,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 06:21:29,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 06:21:29,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 06:21:29,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 06:21:29,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 06:21:29,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 06:21:29,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 06:21:29,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 06:21:29,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 06:21:29,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 06:21:29,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 06:21:29,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 06:21:29,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 06:21:29,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 06:21:29,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 06:21:29,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 06:21:29,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 06:21:29,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 06:21:29,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 06:21:29,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 06:21:29,383 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 06:21:29,408 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 06:21:29,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 06:21:29,409 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 06:21:29,409 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 06:21:29,410 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 06:21:29,410 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 06:21:29,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 06:21:29,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 06:21:29,411 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 06:21:29,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 06:21:29,412 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 06:21:29,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 06:21:29,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 06:21:29,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 06:21:29,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 06:21:29,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 06:21:29,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 06:21:29,413 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 06:21:29,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 06:21:29,413 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 06:21:29,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 06:21:29,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 06:21:29,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 06:21:29,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 06:21:29,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:21:29,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 06:21:29,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 06:21:29,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 06:21:29,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 06:21:29,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 06:21:29,415 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 06:21:29,416 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 06:21:29,416 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 06:21:29,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85f83c4bcdce9397140788b204098e14e4fa25f5b66f064340f4aaa544fbb462 [2022-07-12 06:21:29,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 06:21:29,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 06:21:29,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 06:21:29,629 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 06:21:29,630 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 06:21:29,631 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann04.c [2022-07-12 06:21:29,684 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/214a0edb4/d822a42268484e408d864146d8d0c04e/FLAG4eff61d63 [2022-07-12 06:21:30,021 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 06:21:30,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann04.c [2022-07-12 06:21:30,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/214a0edb4/d822a42268484e408d864146d8d0c04e/FLAG4eff61d63 [2022-07-12 06:21:30,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/214a0edb4/d822a42268484e408d864146d8d0c04e [2022-07-12 06:21:30,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 06:21:30,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 06:21:30,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 06:21:30,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 06:21:30,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 06:21:30,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:21:30" (1/1) ... [2022-07-12 06:21:30,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf90c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:30, skipping insertion in model container [2022-07-12 06:21:30,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:21:30" (1/1) ... [2022-07-12 06:21:30,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 06:21:30,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 06:21:30,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann04.c[1166,1179] [2022-07-12 06:21:30,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:21:30,170 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 06:21:30,181 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann04.c[1166,1179] [2022-07-12 06:21:30,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:21:30,194 INFO L208 MainTranslator]: Completed translation [2022-07-12 06:21:30,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:30 WrapperNode [2022-07-12 06:21:30,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 06:21:30,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 06:21:30,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 06:21:30,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 06:21:30,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:30" (1/1) ... [2022-07-12 06:21:30,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:30" (1/1) ... [2022-07-12 06:21:30,225 INFO L137 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2022-07-12 06:21:30,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 06:21:30,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 06:21:30,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 06:21:30,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 06:21:30,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:30" (1/1) ... [2022-07-12 06:21:30,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:30" (1/1) ... [2022-07-12 06:21:30,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:30" (1/1) ... [2022-07-12 06:21:30,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:30" (1/1) ... [2022-07-12 06:21:30,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:30" (1/1) ... [2022-07-12 06:21:30,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:30" (1/1) ... [2022-07-12 06:21:30,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:30" (1/1) ... [2022-07-12 06:21:30,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 06:21:30,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 06:21:30,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 06:21:30,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 06:21:30,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:30" (1/1) ... [2022-07-12 06:21:30,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:21:30,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:30,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 06:21:30,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 06:21:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 06:21:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 06:21:30,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 06:21:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2022-07-12 06:21:30,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2022-07-12 06:21:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 06:21:30,338 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 06:21:30,339 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 06:21:30,423 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 06:21:30,428 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 06:21:30,428 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 06:21:30,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:21:30 BoogieIcfgContainer [2022-07-12 06:21:30,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 06:21:30,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 06:21:30,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 06:21:30,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 06:21:30,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:21:30" (1/3) ... [2022-07-12 06:21:30,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3586be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:21:30, skipping insertion in model container [2022-07-12 06:21:30,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:30" (2/3) ... [2022-07-12 06:21:30,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3586be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:21:30, skipping insertion in model container [2022-07-12 06:21:30,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:21:30" (3/3) ... [2022-07-12 06:21:30,437 INFO L111 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2022-07-12 06:21:30,448 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 06:21:30,448 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 06:21:30,495 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 06:21:30,500 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@67f06fa7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@96360b6 [2022-07-12 06:21:30,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 06:21:30,507 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) [2022-07-12 06:21:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 06:21:30,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:30,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:30,520 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:30,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:30,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1470704041, now seen corresponding path program 1 times [2022-07-12 06:21:30,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:30,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447403554] [2022-07-12 06:21:30,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:30,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 06:21:30,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:30,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447403554] [2022-07-12 06:21:30,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447403554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:21:30,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:21:30,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:21:30,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111749224] [2022-07-12 06:21:30,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:21:30,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:21:30,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:30,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:21:30,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:21:30,769 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 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 06:21:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:30,906 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-07-12 06:21:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:21:30,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-07-12 06:21:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:30,916 INFO L225 Difference]: With dead ends: 51 [2022-07-12 06:21:30,916 INFO L226 Difference]: Without dead ends: 25 [2022-07-12 06:21:30,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 06:21:30,921 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:30,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 72 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:21:30,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-12 06:21:30,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-12 06:21:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-12 06:21:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-07-12 06:21:30,958 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2022-07-12 06:21:30,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:30,959 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-07-12 06:21:30,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 06:21:30,959 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-07-12 06:21:30,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 06:21:30,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:30,961 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:30,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 06:21:30,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:30,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:30,962 INFO L85 PathProgramCache]: Analyzing trace with hash 941922339, now seen corresponding path program 1 times [2022-07-12 06:21:30,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:30,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285447406] [2022-07-12 06:21:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:30,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:31,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:31,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 06:21:31,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:31,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285447406] [2022-07-12 06:21:31,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285447406] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:31,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303806469] [2022-07-12 06:21:31,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:31,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:31,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:31,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:21:31,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 06:21:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:31,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 06:21:31,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 06:21:31,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 06:21:31,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303806469] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:31,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:31,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-12 06:21:31,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326376227] [2022-07-12 06:21:31,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:31,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 06:21:31,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:31,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 06:21:31,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-12 06:21:31,265 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 06:21:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:31,396 INFO L93 Difference]: Finished difference Result 74 states and 126 transitions. [2022-07-12 06:21:31,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 06:21:31,397 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 19 [2022-07-12 06:21:31,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:31,405 INFO L225 Difference]: With dead ends: 74 [2022-07-12 06:21:31,406 INFO L226 Difference]: Without dead ends: 50 [2022-07-12 06:21:31,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-12 06:21:31,412 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:31,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 91 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:21:31,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-12 06:21:31,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-07-12 06:21:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (27), 12 states have call predecessors, (27), 10 states have call successors, (27) [2022-07-12 06:21:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2022-07-12 06:21:31,430 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 76 transitions. Word has length 19 [2022-07-12 06:21:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:31,430 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 76 transitions. [2022-07-12 06:21:31,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 06:21:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2022-07-12 06:21:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 06:21:31,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:31,436 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:31,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 06:21:31,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:31,640 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash -574784801, now seen corresponding path program 1 times [2022-07-12 06:21:31,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:31,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178172670] [2022-07-12 06:21:31,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:31,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:31,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:31,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:31,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:31,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:31,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 06:21:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 06:21:31,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:31,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178172670] [2022-07-12 06:21:31,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178172670] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:31,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388733375] [2022-07-12 06:21:31,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:31,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:31,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:31,860 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:21:31,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 06:21:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:31,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 06:21:31,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 06:21:32,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-12 06:21:32,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388733375] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:32,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:32,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2022-07-12 06:21:32,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589723915] [2022-07-12 06:21:32,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:32,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 06:21:32,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:32,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 06:21:32,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-12 06:21:32,467 INFO L87 Difference]: Start difference. First operand 50 states and 76 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-12 06:21:32,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:32,590 INFO L93 Difference]: Finished difference Result 120 states and 227 transitions. [2022-07-12 06:21:32,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 06:21:32,591 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 6 states have call successors, (9) Word has length 45 [2022-07-12 06:21:32,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:32,593 INFO L225 Difference]: With dead ends: 120 [2022-07-12 06:21:32,593 INFO L226 Difference]: Without dead ends: 53 [2022-07-12 06:21:32,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-12 06:21:32,595 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:32,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 82 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:21:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-12 06:21:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-12 06:21:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (28), 11 states have call predecessors, (28), 8 states have call successors, (28) [2022-07-12 06:21:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2022-07-12 06:21:32,605 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 45 [2022-07-12 06:21:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:32,605 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2022-07-12 06:21:32,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-12 06:21:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2022-07-12 06:21:32,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-12 06:21:32,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:32,608 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:32,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 06:21:32,813 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,SelfDestructingSolverStorable2 [2022-07-12 06:21:32,814 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:32,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:32,814 INFO L85 PathProgramCache]: Analyzing trace with hash -749766204, now seen corresponding path program 2 times [2022-07-12 06:21:32,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:32,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219925929] [2022-07-12 06:21:32,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:32,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:32,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:32,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:32,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:32,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:32,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:32,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:33,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:33,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 06:21:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:33,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:33,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 06:21:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:33,084 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-12 06:21:33,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:33,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219925929] [2022-07-12 06:21:33,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219925929] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:33,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256408084] [2022-07-12 06:21:33,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 06:21:33,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:33,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:33,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:21:33,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 06:21:33,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 06:21:33,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:21:33,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 06:21:33,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 141 proven. 37 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-12 06:21:33,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 85 proven. 65 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-12 06:21:34,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256408084] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:34,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:34,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 29 [2022-07-12 06:21:34,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274131192] [2022-07-12 06:21:34,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:34,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 06:21:34,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:34,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 06:21:34,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2022-07-12 06:21:34,321 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2022-07-12 06:21:34,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:34,647 INFO L93 Difference]: Finished difference Result 106 states and 183 transitions. [2022-07-12 06:21:34,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 06:21:34,648 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) Word has length 79 [2022-07-12 06:21:34,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:34,650 INFO L225 Difference]: With dead ends: 106 [2022-07-12 06:21:34,651 INFO L226 Difference]: Without dead ends: 58 [2022-07-12 06:21:34,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=298, Invalid=1342, Unknown=0, NotChecked=0, Total=1640 [2022-07-12 06:21:34,652 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:34,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 183 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:21:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-12 06:21:34,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2022-07-12 06:21:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (24), 11 states have call predecessors, (24), 8 states have call successors, (24) [2022-07-12 06:21:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2022-07-12 06:21:34,661 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 79 [2022-07-12 06:21:34,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:34,662 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2022-07-12 06:21:34,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2022-07-12 06:21:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2022-07-12 06:21:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-12 06:21:34,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:34,666 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 12, 9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:34,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 06:21:34,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:34,884 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:34,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:34,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2109661843, now seen corresponding path program 3 times [2022-07-12 06:21:34,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:34,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83450361] [2022-07-12 06:21:34,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:34,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:34,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:34,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 06:21:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 06:21:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:21:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 06:21:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 06:21:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 391 proven. 197 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-07-12 06:21:35,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:35,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83450361] [2022-07-12 06:21:35,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83450361] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:35,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649600147] [2022-07-12 06:21:35,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 06:21:35,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:35,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:35,344 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:21:35,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 06:21:35,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2022-07-12 06:21:35,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:21:35,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 06:21:35,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 367 proven. 209 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-07-12 06:21:35,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 410 proven. 201 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2022-07-12 06:21:38,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649600147] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:38,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:38,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 26] total 39 [2022-07-12 06:21:38,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622429767] [2022-07-12 06:21:38,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:38,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-12 06:21:38,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:38,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-12 06:21:38,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1293, Unknown=0, NotChecked=0, Total=1482 [2022-07-12 06:21:38,381 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 32 states have internal predecessors, (80), 15 states have call successors, (18), 1 states have call predecessors, (18), 18 states have return successors, (33), 19 states have call predecessors, (33), 15 states have call successors, (33) [2022-07-12 06:21:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:39,141 INFO L93 Difference]: Finished difference Result 128 states and 237 transitions. [2022-07-12 06:21:39,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 06:21:39,142 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 32 states have internal predecessors, (80), 15 states have call successors, (18), 1 states have call predecessors, (18), 18 states have return successors, (33), 19 states have call predecessors, (33), 15 states have call successors, (33) Word has length 144 [2022-07-12 06:21:39,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:39,144 INFO L225 Difference]: With dead ends: 128 [2022-07-12 06:21:39,144 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 06:21:39,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 311 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=799, Invalid=3623, Unknown=0, NotChecked=0, Total=4422 [2022-07-12 06:21:39,147 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 68 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:39,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 273 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 06:21:39,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 06:21:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2022-07-12 06:21:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 11 states have call successors, (11), 5 states have call predecessors, (11), 10 states have return successors, (35), 15 states have call predecessors, (35), 11 states have call successors, (35) [2022-07-12 06:21:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2022-07-12 06:21:39,164 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 144 [2022-07-12 06:21:39,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:39,165 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2022-07-12 06:21:39,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 32 states have internal predecessors, (80), 15 states have call successors, (18), 1 states have call predecessors, (18), 18 states have return successors, (33), 19 states have call predecessors, (33), 15 states have call successors, (33) [2022-07-12 06:21:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2022-07-12 06:21:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-12 06:21:39,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:39,170 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:39,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 06:21:39,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:39,387 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:39,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:39,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1942933932, now seen corresponding path program 4 times [2022-07-12 06:21:39,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:39,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163170666] [2022-07-12 06:21:39,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:39,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 06:21:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 06:21:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:21:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 06:21:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 06:21:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 06:21:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:21:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 06:21:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 258 proven. 609 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2022-07-12 06:21:39,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:39,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163170666] [2022-07-12 06:21:39,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163170666] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:39,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789072783] [2022-07-12 06:21:39,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 06:21:39,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:39,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:39,820 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:21:39,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 06:21:40,043 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 06:21:40,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:21:40,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 06:21:40,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:40,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 1016 proven. 196 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-07-12 06:21:40,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 264 proven. 632 refuted. 0 times theorem prover too weak. 845 trivial. 0 not checked. [2022-07-12 06:21:41,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789072783] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:41,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:41,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 21] total 27 [2022-07-12 06:21:41,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854852040] [2022-07-12 06:21:41,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:41,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 06:21:41,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:41,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 06:21:41,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2022-07-12 06:21:41,972 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand has 27 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) [2022-07-12 06:21:42,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:42,392 INFO L93 Difference]: Finished difference Result 152 states and 268 transitions. [2022-07-12 06:21:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 06:21:42,393 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) Word has length 183 [2022-07-12 06:21:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:42,395 INFO L225 Difference]: With dead ends: 152 [2022-07-12 06:21:42,395 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 06:21:42,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 408 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 06:21:42,397 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 41 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:42,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 257 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 06:21:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 06:21:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2022-07-12 06:21:42,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 57 states have internal predecessors, (61), 14 states have call successors, (14), 5 states have call predecessors, (14), 14 states have return successors, (62), 22 states have call predecessors, (62), 14 states have call successors, (62) [2022-07-12 06:21:42,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 137 transitions. [2022-07-12 06:21:42,418 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 137 transitions. Word has length 183 [2022-07-12 06:21:42,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:42,419 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 137 transitions. [2022-07-12 06:21:42,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) [2022-07-12 06:21:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 137 transitions. [2022-07-12 06:21:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-12 06:21:42,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:42,421 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 16, 12, 11, 11, 11, 11, 11, 11, 11, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:42,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-12 06:21:42,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:42,621 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:42,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:42,622 INFO L85 PathProgramCache]: Analyzing trace with hash 66624188, now seen corresponding path program 5 times [2022-07-12 06:21:42,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:42,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783273761] [2022-07-12 06:21:42,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:42,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 06:21:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 06:21:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 06:21:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:21:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 06:21:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 06:21:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:21:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 06:21:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1872 backedges. 327 proven. 605 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2022-07-12 06:21:42,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:42,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783273761] [2022-07-12 06:21:42,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783273761] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:42,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178033484] [2022-07-12 06:21:42,866 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 06:21:42,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:42,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:42,867 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:21:42,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 06:21:43,004 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-12 06:21:43,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:21:43,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 06:21:43,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1872 backedges. 1065 proven. 18 refuted. 0 times theorem prover too weak. 789 trivial. 0 not checked. [2022-07-12 06:21:43,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1872 backedges. 324 proven. 328 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2022-07-12 06:21:43,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178033484] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:43,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:43,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 19 [2022-07-12 06:21:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332723769] [2022-07-12 06:21:43,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:43,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 06:21:43,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:43,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 06:21:43,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-07-12 06:21:43,866 INFO L87 Difference]: Start difference. First operand 85 states and 137 transitions. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 9 states have call successors, (20), 2 states have call predecessors, (20), 9 states have return successors, (29), 12 states have call predecessors, (29), 9 states have call successors, (29) [2022-07-12 06:21:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:44,059 INFO L93 Difference]: Finished difference Result 203 states and 456 transitions. [2022-07-12 06:21:44,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 06:21:44,061 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 9 states have call successors, (20), 2 states have call predecessors, (20), 9 states have return successors, (29), 12 states have call predecessors, (29), 9 states have call successors, (29) Word has length 190 [2022-07-12 06:21:44,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:44,063 INFO L225 Difference]: With dead ends: 203 [2022-07-12 06:21:44,063 INFO L226 Difference]: Without dead ends: 123 [2022-07-12 06:21:44,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 435 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2022-07-12 06:21:44,066 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 118 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:44,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 136 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:21:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-12 06:21:44,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-07-12 06:21:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.1) internal successors, (77), 71 states have internal predecessors, (77), 19 states have call successors, (19), 9 states have call predecessors, (19), 15 states have return successors, (77), 24 states have call predecessors, (77), 19 states have call successors, (77) [2022-07-12 06:21:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 173 transitions. [2022-07-12 06:21:44,080 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 173 transitions. Word has length 190 [2022-07-12 06:21:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:44,081 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 173 transitions. [2022-07-12 06:21:44,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 9 states have call successors, (20), 2 states have call predecessors, (20), 9 states have return successors, (29), 12 states have call predecessors, (29), 9 states have call successors, (29) [2022-07-12 06:21:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 173 transitions. [2022-07-12 06:21:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-12 06:21:44,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:44,083 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 12, 9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:44,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 06:21:44,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:44,311 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:44,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:44,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1294012555, now seen corresponding path program 6 times [2022-07-12 06:21:44,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:44,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186168432] [2022-07-12 06:21:44,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:44,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 06:21:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 06:21:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 06:21:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 06:21:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:21:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:44,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 158 proven. 354 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2022-07-12 06:21:44,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:44,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186168432] [2022-07-12 06:21:44,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186168432] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:44,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756724423] [2022-07-12 06:21:44,555 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 06:21:44,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:44,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:44,572 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:21:44,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 06:21:44,753 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-07-12 06:21:44,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:21:44,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 06:21:44,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 595 proven. 114 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2022-07-12 06:21:44,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 160 proven. 360 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2022-07-12 06:21:46,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756724423] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:46,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:46,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 23 [2022-07-12 06:21:46,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697324709] [2022-07-12 06:21:46,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:46,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 06:21:46,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:46,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 06:21:46,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-07-12 06:21:46,058 INFO L87 Difference]: Start difference. First operand 105 states and 173 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 20 states have internal predecessors, (69), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2022-07-12 06:21:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:46,373 INFO L93 Difference]: Finished difference Result 201 states and 358 transitions. [2022-07-12 06:21:46,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 06:21:46,378 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 20 states have internal predecessors, (69), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) Word has length 144 [2022-07-12 06:21:46,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:46,379 INFO L225 Difference]: With dead ends: 201 [2022-07-12 06:21:46,379 INFO L226 Difference]: Without dead ends: 105 [2022-07-12 06:21:46,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 320 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=433, Invalid=1459, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 06:21:46,381 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:46,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 174 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:21:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-12 06:21:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-12 06:21:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.1) internal successors, (77), 71 states have internal predecessors, (77), 19 states have call successors, (19), 9 states have call predecessors, (19), 15 states have return successors, (69), 24 states have call predecessors, (69), 19 states have call successors, (69) [2022-07-12 06:21:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 165 transitions. [2022-07-12 06:21:46,389 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 165 transitions. Word has length 144 [2022-07-12 06:21:46,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:46,389 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 165 transitions. [2022-07-12 06:21:46,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 20 states have internal predecessors, (69), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2022-07-12 06:21:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 165 transitions. [2022-07-12 06:21:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-12 06:21:46,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:46,391 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:46,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 06:21:46,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:46,608 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:46,608 INFO L85 PathProgramCache]: Analyzing trace with hash 332854534, now seen corresponding path program 7 times [2022-07-12 06:21:46,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:46,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606956060] [2022-07-12 06:21:46,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:46,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 06:21:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 06:21:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:21:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 06:21:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 06:21:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:21:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 06:21:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:21:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 686 proven. 70 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2022-07-12 06:21:46,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:46,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606956060] [2022-07-12 06:21:46,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606956060] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:46,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132161731] [2022-07-12 06:21:46,956 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 06:21:46,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:46,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:46,976 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:21:46,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 06:21:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:47,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 06:21:47,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:47,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 657 proven. 84 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2022-07-12 06:21:47,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 711 proven. 75 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2022-07-12 06:21:51,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132161731] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:51,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:51,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 33] total 38 [2022-07-12 06:21:51,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887080004] [2022-07-12 06:21:51,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:51,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-12 06:21:51,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:51,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-12 06:21:51,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2022-07-12 06:21:51,133 INFO L87 Difference]: Start difference. First operand 105 states and 165 transitions. Second operand has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 31 states have internal predecessors, (59), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) [2022-07-12 06:21:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:51,923 INFO L93 Difference]: Finished difference Result 170 states and 306 transitions. [2022-07-12 06:21:51,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 06:21:51,923 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 31 states have internal predecessors, (59), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) Word has length 183 [2022-07-12 06:21:51,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:51,925 INFO L225 Difference]: With dead ends: 170 [2022-07-12 06:21:51,925 INFO L226 Difference]: Without dead ends: 166 [2022-07-12 06:21:51,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=771, Invalid=3651, Unknown=0, NotChecked=0, Total=4422 [2022-07-12 06:21:51,927 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 27 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:51,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 309 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 06:21:51,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-12 06:21:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 122. [2022-07-12 06:21:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 82 states have internal predecessors, (88), 20 states have call successors, (20), 9 states have call predecessors, (20), 20 states have return successors, (97), 30 states have call predecessors, (97), 20 states have call successors, (97) [2022-07-12 06:21:51,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 205 transitions. [2022-07-12 06:21:51,941 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 205 transitions. Word has length 183 [2022-07-12 06:21:51,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:51,942 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 205 transitions. [2022-07-12 06:21:51,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 31 states have internal predecessors, (59), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) [2022-07-12 06:21:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 205 transitions. [2022-07-12 06:21:51,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-12 06:21:51,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:51,945 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:51,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 06:21:52,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-12 06:21:52,160 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:52,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:52,160 INFO L85 PathProgramCache]: Analyzing trace with hash -860565711, now seen corresponding path program 8 times [2022-07-12 06:21:52,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:52,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020801538] [2022-07-12 06:21:52,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:52,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 06:21:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 06:21:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:21:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 06:21:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 06:21:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 06:21:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 06:21:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 503 proven. 360 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2022-07-12 06:21:52,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:52,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020801538] [2022-07-12 06:21:52,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020801538] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:52,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128800660] [2022-07-12 06:21:52,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 06:21:52,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:52,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:52,612 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:21:52,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 06:21:52,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 06:21:52,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:21:52,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 06:21:52,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2022-07-12 06:21:53,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2022-07-12 06:21:55,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128800660] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:55,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:55,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 28] total 34 [2022-07-12 06:21:55,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004893525] [2022-07-12 06:21:55,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:55,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-12 06:21:55,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:55,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-12 06:21:55,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 06:21:55,987 INFO L87 Difference]: Start difference. First operand 122 states and 205 transitions. Second operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2022-07-12 06:21:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:56,588 INFO L93 Difference]: Finished difference Result 239 states and 471 transitions. [2022-07-12 06:21:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-12 06:21:56,588 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) Word has length 170 [2022-07-12 06:21:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:56,589 INFO L225 Difference]: With dead ends: 239 [2022-07-12 06:21:56,589 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 06:21:56,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 376 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=826, Invalid=3206, Unknown=0, NotChecked=0, Total=4032 [2022-07-12 06:21:56,591 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 29 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:56,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 184 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 06:21:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 06:21:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 06:21:56,593 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) [2022-07-12 06:21:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 06:21:56,593 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 170 [2022-07-12 06:21:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:56,593 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 06:21:56,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2022-07-12 06:21:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 06:21:56,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 06:21:56,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 06:21:56,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 06:21:56,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 06:21:56,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 06:21:58,521 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 06:21:58,521 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 06:21:58,521 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 06:21:58,521 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 33) no Hoare annotation was computed. [2022-07-12 06:21:58,522 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 06:21:58,522 INFO L902 garLoopResultBuilder]: At program point L27(lines 27 47) the Hoare annotation is: true [2022-07-12 06:21:58,522 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2022-07-12 06:21:58,522 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2022-07-12 06:21:58,522 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2022-07-12 06:21:58,522 INFO L902 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: true [2022-07-12 06:21:58,522 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-07-12 06:21:58,522 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 40) no Hoare annotation was computed. [2022-07-12 06:21:58,523 INFO L899 garLoopResultBuilder]: For program point ackermannEXIT(lines 16 24) no Hoare annotation was computed. [2022-07-12 06:21:58,523 INFO L895 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (and (or (not (<= 1 |ackermann_#in~n|)) (not (= |ackermann_#in~m| 0)) (not (< |ackermann_#in~n| 2))) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2022-07-12 06:21:58,523 INFO L899 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2022-07-12 06:21:58,523 INFO L902 garLoopResultBuilder]: At program point ackermannENTRY(lines 16 24) the Hoare annotation is: true [2022-07-12 06:21:58,523 INFO L895 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2022-07-12 06:21:58,523 INFO L895 garLoopResultBuilder]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse4 (= ackermann_~n |ackermann_#in~n|)) (.cse5 (= ackermann_~m |ackermann_#in~m|))) (let ((.cse0 (and (= |ackermann_#in~m| 0) .cse4 .cse5)) (.cse1 (<= 2 ackermann_~m))) (and (or (not (<= |ackermann_#in~m| 0)) .cse0) (let ((.cse2 (<= 1 |ackermann_#in~n|))) (or (and .cse1 .cse2) (and (<= |ackermann_#t~ret5| 2) .cse2) .cse0 (<= 2 |ackermann_#in~n|))) (let ((.cse3 (<= 5 |ackermann_#t~ret5|)) (.cse7 (<= ackermann_~m 1)) (.cse6 (<= 3 |ackermann_#t~ret5|)) (.cse8 (<= |ackermann_#in~n| 1))) (or (and .cse3 .cse1 .cse4 .cse5) (and (<= |ackermann_#in~n| 2) .cse6 .cse4 .cse5 .cse7) (and .cse3 .cse4 .cse5 (<= |ackermann_#in~n| 4)) (and (<= |ackermann_#in~n| 3) .cse4 .cse5 (<= |ackermann_#in~m| 1) (<= 4 |ackermann_#t~ret5|)) (not (<= 1 |ackermann_#in~m|)) (and .cse4 (<= 2 |ackermann_#t~ret5|) .cse5 .cse7 .cse8) (and .cse6 .cse4 .cse5 .cse8) (and (<= 6 |ackermann_#t~ret5|) .cse4 .cse5)))))) [2022-07-12 06:21:58,523 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 22) no Hoare annotation was computed. [2022-07-12 06:21:58,524 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2022-07-12 06:21:58,524 INFO L899 garLoopResultBuilder]: For program point L23-3(line 23) no Hoare annotation was computed. [2022-07-12 06:21:58,524 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 19) no Hoare annotation was computed. [2022-07-12 06:21:58,524 INFO L899 garLoopResultBuilder]: For program point ackermannFINAL(lines 16 24) no Hoare annotation was computed. [2022-07-12 06:21:58,527 INFO L356 BasicCegarLoop]: Path program histogram: [8, 1, 1] [2022-07-12 06:21:58,528 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 06:21:58,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:21:58 BoogieIcfgContainer [2022-07-12 06:21:58,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 06:21:58,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 06:21:58,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 06:21:58,535 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 06:21:58,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:21:30" (3/4) ... [2022-07-12 06:21:58,539 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 06:21:58,543 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2022-07-12 06:21:58,546 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-12 06:21:58,546 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-12 06:21:58,547 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 06:21:58,547 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 06:21:58,572 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 06:21:58,572 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 06:21:58,573 INFO L158 Benchmark]: Toolchain (without parser) took 28535.86ms. Allocated memory was 90.2MB in the beginning and 243.3MB in the end (delta: 153.1MB). Free memory was 56.7MB in the beginning and 114.4MB in the end (delta: -57.7MB). Peak memory consumption was 95.2MB. Max. memory is 16.1GB. [2022-07-12 06:21:58,573 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory was 60.5MB in the beginning and 60.4MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:21:58,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.54ms. Allocated memory is still 90.2MB. Free memory was 56.6MB in the beginning and 66.9MB in the end (delta: -10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 06:21:58,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.68ms. Allocated memory is still 90.2MB. Free memory was 66.9MB in the beginning and 65.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:21:58,574 INFO L158 Benchmark]: Boogie Preprocessor took 21.12ms. Allocated memory is still 90.2MB. Free memory was 65.5MB in the beginning and 64.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:21:58,574 INFO L158 Benchmark]: RCFGBuilder took 182.74ms. Allocated memory is still 90.2MB. Free memory was 64.5MB in the beginning and 55.0MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 06:21:58,574 INFO L158 Benchmark]: TraceAbstraction took 28102.55ms. Allocated memory was 90.2MB in the beginning and 243.3MB in the end (delta: 153.1MB). Free memory was 54.4MB in the beginning and 116.5MB in the end (delta: -62.1MB). Peak memory consumption was 139.9MB. Max. memory is 16.1GB. [2022-07-12 06:21:58,575 INFO L158 Benchmark]: Witness Printer took 37.62ms. Allocated memory is still 243.3MB. Free memory was 116.5MB in the beginning and 114.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:21:58,576 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.16ms. Allocated memory is still 90.2MB. Free memory was 60.5MB in the beginning and 60.4MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 160.54ms. Allocated memory is still 90.2MB. Free memory was 56.6MB in the beginning and 66.9MB in the end (delta: -10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.68ms. Allocated memory is still 90.2MB. Free memory was 66.9MB in the beginning and 65.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.12ms. Allocated memory is still 90.2MB. Free memory was 65.5MB in the beginning and 64.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 182.74ms. Allocated memory is still 90.2MB. Free memory was 64.5MB in the beginning and 55.0MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 28102.55ms. Allocated memory was 90.2MB in the beginning and 243.3MB in the end (delta: 153.1MB). Free memory was 54.4MB in the beginning and 116.5MB in the end (delta: -62.1MB). Peak memory consumption was 139.9MB. Max. memory is 16.1GB. * Witness Printer took 37.62ms. Allocated memory is still 243.3MB. Free memory was 116.5MB in the beginning and 114.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: 45]: 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: 28.1s, OverallIterations: 10, TraceHistogramMax: 28, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 469 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 427 mSDsluCounter, 1761 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1504 mSDsCounter, 875 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3771 IncrementalHoareTripleChecker+Invalid, 4646 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 875 mSolverCounterUnsat, 257 mSDtfsCounter, 3771 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2959 GetRequests, 2574 SyntacticMatches, 21 SemanticMatches, 364 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3798 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=9, InterpolantAutomatonStates: 206, 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, 10 MinimizatonAttempts, 85 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 482 PreInvPairs, 1115 NumberOfFragments, 179 HoareAnnotationTreeSize, 482 FomulaSimplifications, 4332 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 6 FomulaSimplificationsInter, 8703 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 2326 NumberOfCodeBlocks, 2225 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 3455 ConstructedInterpolants, 0 QuantifiedInterpolants, 6534 SizeOfPredicates, 60 NumberOfNonLiveVariables, 3278 ConjunctsInSsa, 197 ConjunctsInUnsatCore, 28 InterpolantComputations, 1 PerfectInterpolantSequences, 22292/27699 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-12 06:21:58,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE