./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id2_b3_o5.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/id2_b3_o5.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1d5fa637 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/recursive-simple/id2_b3_o5.c ../results/automizer-verification-files/SV-COMP24_unreach-call/id2_b3_o5.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-dev-1d5fa63-m [2024-09-13 10:27:53,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 10:27:53,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 10:27:53,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 10:27:53,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 10:27:53,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 10:27:53,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 10:27:53,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 10:27:53,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 10:27:53,239 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 10:27:53,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 10:27:53,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 10:27:53,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 10:27:53,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 10:27:53,240 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 10:27:53,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 10:27:53,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 10:27:53,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 10:27:53,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 10:27:53,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 10:27:53,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 10:27:53,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 10:27:53,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 10:27:53,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 10:27:53,246 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 10:27:53,246 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 10:27:53,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 10:27:53,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 10:27:53,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 10:27:53,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 10:27:53,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 10:27:53,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 10:27:53,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:27:53,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 10:27:53,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 10:27:53,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 10:27:53,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 10:27:53,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 10:27:53,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 10:27:53,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 10:27:53,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 10:27:53,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 10:27:53,251 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/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.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-13 10:27:53,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 10:27:53,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 10:27:53,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 10:27:53,467 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 10:27:53,468 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 10:27:53,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/id2_b3_o5.c [2024-09-13 10:27:54,826 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 10:27:54,971 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 10:27:54,971 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_b3_o5.c [2024-09-13 10:27:54,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/736ea5ce2/ca7ca56021434c87bbd753a4676bbd33/FLAG95ecba87f [2024-09-13 10:27:54,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/736ea5ce2/ca7ca56021434c87bbd753a4676bbd33 [2024-09-13 10:27:54,991 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 10:27:54,992 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 10:27:54,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/id2_b3_o5.yml/witness-2.1.yml [2024-09-13 10:27:55,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 10:27:55,029 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 10:27:55,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 10:27:55,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 10:27:55,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 10:27:55,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:27:54" (1/2) ... [2024-09-13 10:27:55,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dce209a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:27:55, skipping insertion in model container [2024-09-13 10:27:55,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:27:54" (1/2) ... [2024-09-13 10:27:55,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@32860b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:27:55, skipping insertion in model container [2024-09-13 10:27:55,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:27:55" (2/2) ... [2024-09-13 10:27:55,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dce209a and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:27:55, skipping insertion in model container [2024-09-13 10:27:55,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:27:55" (2/2) ... [2024-09-13 10:27:55,044 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 10:27:55,044 INFO L1541 ArrayList]: Function contract at [L9]: requires null, ensures ((\result % 4294967296) < 5) [2024-09-13 10:27:55,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 10:27:55,170 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_b3_o5.c[771,784] [2024-09-13 10:27:55,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:27:55,183 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global [2024-09-13 10:27:55,213 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_b3_o5.c[771,784] [2024-09-13 10:27:55,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:27:55,227 INFO L204 MainTranslator]: Completed translation [2024-09-13 10:27:55,227 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:27:55 WrapperNode [2024-09-13 10:27:55,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 10:27:55,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 10:27:55,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 10:27:55,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 10:27:55,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:27:55" (1/1) ... [2024-09-13 10:27:55,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:27:55" (1/1) ... [2024-09-13 10:27:55,271 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-09-13 10:27:55,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 10:27:55,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 10:27:55,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 10:27:55,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 10:27:55,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:27:55" (1/1) ... [2024-09-13 10:27:55,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:27:55" (1/1) ... [2024-09-13 10:27:55,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:27:55" (1/1) ... [2024-09-13 10:27:55,300 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure id is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-13 10:27:55,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:27:55" (1/1) ... [2024-09-13 10:27:55,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:27:55" (1/1) ... [2024-09-13 10:27:55,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:27:55" (1/1) ... [2024-09-13 10:27:55,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:27:55" (1/1) ... [2024-09-13 10:27:55,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:27:55" (1/1) ... [2024-09-13 10:27:55,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:27:55" (1/1) ... [2024-09-13 10:27:55,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 10:27:55,307 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 10:27:55,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 10:27:55,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 10:27:55,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:27:55" (1/1) ... [2024-09-13 10:27:55,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:27:55,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:27:55,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 10:27:55,349 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 10:27:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 10:27:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 10:27:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2024-09-13 10:27:55,380 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2024-09-13 10:27:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 10:27:55,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 10:27:55,381 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-09-13 10:27:55,381 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-09-13 10:27:55,429 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 10:27:55,430 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 10:27:55,562 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-13 10:27:55,563 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 10:27:55,593 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 10:27:55,594 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-13 10:27:55,598 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:27:55 BoogieIcfgContainer [2024-09-13 10:27:55,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 10:27:55,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 10:27:55,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 10:27:55,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 10:27:55,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 10:27:54" (1/4) ... [2024-09-13 10:27:55,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330ff062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:27:55, skipping insertion in model container [2024-09-13 10:27:55,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:27:55" (2/4) ... [2024-09-13 10:27:55,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330ff062 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 10:27:55, skipping insertion in model container [2024-09-13 10:27:55,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:27:55" (3/4) ... [2024-09-13 10:27:55,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330ff062 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 10:27:55, skipping insertion in model container [2024-09-13 10:27:55,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:27:55" (4/4) ... [2024-09-13 10:27:55,613 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b3_o5.c [2024-09-13 10:27:55,640 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 10:27:55,644 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-09-13 10:27:55,712 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 10:27:55,730 INFO L336 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@17d8dca5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 10:27:55,730 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-13 10:27:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 10:27:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 10:27:55,746 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:27:55,747 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 10:27:55,751 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-13 10:27:55,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:27:55,760 INFO L85 PathProgramCache]: Analyzing trace with hash 73343560, now seen corresponding path program 1 times [2024-09-13 10:27:55,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:27:55,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111954457] [2024-09-13 10:27:55,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:27:55,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:27:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:27:55,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:27:55,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111954457] [2024-09-13 10:27:55,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111954457] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:27:55,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:27:55,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:27:55,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456034811] [2024-09-13 10:27:55,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:27:55,984 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:27:55,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:27:56,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:27:56,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:27:56,068 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:27:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:27:56,102 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-09-13 10:27:56,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:27:56,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-13 10:27:56,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:27:56,109 INFO L225 Difference]: With dead ends: 25 [2024-09-13 10:27:56,110 INFO L226 Difference]: Without dead ends: 23 [2024-09-13 10:27:56,111 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:27:56,114 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:27:56,115 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:27:56,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-13 10:27:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-09-13 10:27:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 10:27:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-09-13 10:27:56,140 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 5 [2024-09-13 10:27:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:27:56,141 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-09-13 10:27:56,141 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:27:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-09-13 10:27:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-13 10:27:56,142 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:27:56,142 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:27:56,142 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 10:27:56,143 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-13 10:27:56,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:27:56,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1610947187, now seen corresponding path program 1 times [2024-09-13 10:27:56,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:27:56,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160721901] [2024-09-13 10:27:56,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:27:56,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:27:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:56,212 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:27:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:27:56,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:27:56,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160721901] [2024-09-13 10:27:56,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160721901] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:27:56,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:27:56,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 10:27:56,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278342522] [2024-09-13 10:27:56,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:27:56,261 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:27:56,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:27:56,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:27:56,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:27:56,262 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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) [2024-09-13 10:27:56,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:27:56,283 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-09-13 10:27:56,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:27:56,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2024-09-13 10:27:56,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:27:56,284 INFO L225 Difference]: With dead ends: 25 [2024-09-13 10:27:56,284 INFO L226 Difference]: Without dead ends: 23 [2024-09-13 10:27:56,284 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:27:56,285 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:27:56,286 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:27:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-13 10:27:56,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-13 10:27:56,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-13 10:27:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-09-13 10:27:56,289 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 9 [2024-09-13 10:27:56,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:27:56,290 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-09-13 10:27:56,290 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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) [2024-09-13 10:27:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-09-13 10:27:56,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-13 10:27:56,291 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:27:56,291 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:27:56,291 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 10:27:56,291 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-13 10:27:56,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:27:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash -477854253, now seen corresponding path program 1 times [2024-09-13 10:27:56,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:27:56,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656923471] [2024-09-13 10:27:56,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:27:56,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:27:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:56,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 10:27:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:27:56,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:27:56,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656923471] [2024-09-13 10:27:56,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656923471] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:27:56,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:27:56,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 10:27:56,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062568983] [2024-09-13 10:27:56,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:27:56,439 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:27:56,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:27:56,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:27:56,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:27:56,441 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 10:27:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:27:56,466 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-09-13 10:27:56,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:27:56,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-13 10:27:56,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:27:56,467 INFO L225 Difference]: With dead ends: 27 [2024-09-13 10:27:56,468 INFO L226 Difference]: Without dead ends: 27 [2024-09-13 10:27:56,469 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:27:56,469 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:27:56,471 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:27:56,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-13 10:27:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-13 10:27:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-13 10:27:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-13 10:27:56,477 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 12 [2024-09-13 10:27:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:27:56,478 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-13 10:27:56,478 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 10:27:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-13 10:27:56,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-13 10:27:56,479 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:27:56,480 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:27:56,480 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 10:27:56,480 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-13 10:27:56,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:27:56,481 INFO L85 PathProgramCache]: Analyzing trace with hash -477854222, now seen corresponding path program 1 times [2024-09-13 10:27:56,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:27:56,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330394370] [2024-09-13 10:27:56,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:27:56,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:27:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:56,561 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 10:27:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:27:56,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:27:56,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330394370] [2024-09-13 10:27:56,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330394370] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:27:56,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:27:56,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 10:27:56,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849601609] [2024-09-13 10:27:56,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:27:56,581 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 10:27:56,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:27:56,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 10:27:56,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-13 10:27:56,582 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 10:27:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:27:56,604 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-09-13 10:27:56,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 10:27:56,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-13 10:27:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:27:56,605 INFO L225 Difference]: With dead ends: 29 [2024-09-13 10:27:56,605 INFO L226 Difference]: Without dead ends: 29 [2024-09-13 10:27:56,606 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-13 10:27:56,607 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:27:56,607 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:27:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-13 10:27:56,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-09-13 10:27:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-13 10:27:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-09-13 10:27:56,610 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 12 [2024-09-13 10:27:56,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:27:56,611 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-09-13 10:27:56,611 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 10:27:56,611 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-09-13 10:27:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 10:27:56,612 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:27:56,612 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:27:56,612 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 10:27:56,612 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-13 10:27:56,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:27:56,613 INFO L85 PathProgramCache]: Analyzing trace with hash -518888393, now seen corresponding path program 1 times [2024-09-13 10:27:56,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:27:56,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509634294] [2024-09-13 10:27:56,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:27:56,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:27:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:56,677 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:27:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:56,735 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 10:27:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:27:56,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:27:56,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509634294] [2024-09-13 10:27:56,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509634294] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:27:56,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:27:56,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-13 10:27:56,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699474945] [2024-09-13 10:27:56,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:27:56,753 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 10:27:56,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:27:56,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 10:27:56,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-13 10:27:56,754 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:27:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:27:56,782 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-09-13 10:27:56,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 10:27:56,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-13 10:27:56,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:27:56,783 INFO L225 Difference]: With dead ends: 31 [2024-09-13 10:27:56,783 INFO L226 Difference]: Without dead ends: 29 [2024-09-13 10:27:56,783 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-13 10:27:56,784 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:27:56,784 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:27:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-13 10:27:56,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-13 10:27:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-13 10:27:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-13 10:27:56,789 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2024-09-13 10:27:56,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:27:56,789 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-13 10:27:56,789 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:27:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-13 10:27:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-13 10:27:56,790 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:27:56,790 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:27:56,790 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 10:27:56,790 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-13 10:27:56,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:27:56,791 INFO L85 PathProgramCache]: Analyzing trace with hash 77705380, now seen corresponding path program 1 times [2024-09-13 10:27:56,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:27:56,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222476825] [2024-09-13 10:27:56,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:27:56,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:27:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:56,828 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 10:27:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:56,865 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 10:27:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-13 10:27:56,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:27:56,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222476825] [2024-09-13 10:27:56,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222476825] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:27:56,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:27:56,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 10:27:56,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016900405] [2024-09-13 10:27:56,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:27:56,887 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:27:56,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:27:56,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:27:56,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:27:56,889 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:27:56,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:27:56,911 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-09-13 10:27:56,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:27:56,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-09-13 10:27:56,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:27:56,912 INFO L225 Difference]: With dead ends: 31 [2024-09-13 10:27:56,913 INFO L226 Difference]: Without dead ends: 31 [2024-09-13 10:27:56,913 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:27:56,914 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:27:56,914 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:27:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-13 10:27:56,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-13 10:27:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 10:27:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-13 10:27:56,918 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 25 [2024-09-13 10:27:56,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:27:56,918 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-13 10:27:56,918 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:27:56,918 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-13 10:27:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-13 10:27:56,919 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:27:56,919 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:27:56,919 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 10:27:56,919 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-13 10:27:56,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:27:56,920 INFO L85 PathProgramCache]: Analyzing trace with hash 106334531, now seen corresponding path program 1 times [2024-09-13 10:27:56,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:27:56,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733443049] [2024-09-13 10:27:56,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:27:56,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:27:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:57,061 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 10:27:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:57,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 10:27:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-13 10:27:57,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:27:57,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733443049] [2024-09-13 10:27:57,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733443049] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:27:57,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:27:57,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-13 10:27:57,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253198643] [2024-09-13 10:27:57,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:27:57,111 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 10:27:57,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:27:57,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 10:27:57,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-13 10:27:57,112 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:27:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:27:57,144 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-09-13 10:27:57,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 10:27:57,144 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-09-13 10:27:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:27:57,145 INFO L225 Difference]: With dead ends: 35 [2024-09-13 10:27:57,145 INFO L226 Difference]: Without dead ends: 35 [2024-09-13 10:27:57,145 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-13 10:27:57,146 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:27:57,146 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:27:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-13 10:27:57,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-13 10:27:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-13 10:27:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-09-13 10:27:57,150 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 25 [2024-09-13 10:27:57,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:27:57,150 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-09-13 10:27:57,150 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:27:57,150 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-09-13 10:27:57,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 10:27:57,151 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:27:57,151 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:27:57,151 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 10:27:57,151 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-13 10:27:57,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:27:57,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1119410942, now seen corresponding path program 1 times [2024-09-13 10:27:57,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:27:57,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948520844] [2024-09-13 10:27:57,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:27:57,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:27:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:57,201 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 10:27:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:57,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 10:27:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-13 10:27:57,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:27:57,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948520844] [2024-09-13 10:27:57,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948520844] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:27:57,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584094853] [2024-09-13 10:27:57,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:27:57,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:27:57,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:27:57,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:27:57,268 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 10:27:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:57,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-13 10:27:57,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:27:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-13 10:27:57,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:27:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-13 10:27:57,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584094853] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 10:27:57,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 10:27:57,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8, 8] total 10 [2024-09-13 10:27:57,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3578663] [2024-09-13 10:27:57,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:27:57,401 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:27:57,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:27:57,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:27:57,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-09-13 10:27:57,402 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:27:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:27:57,409 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-09-13 10:27:57,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:27:57,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-09-13 10:27:57,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:27:57,410 INFO L225 Difference]: With dead ends: 34 [2024-09-13 10:27:57,410 INFO L226 Difference]: Without dead ends: 34 [2024-09-13 10:27:57,411 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-09-13 10:27:57,411 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:27:57,411 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:27:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-13 10:27:57,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-13 10:27:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-13 10:27:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-09-13 10:27:57,414 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2024-09-13 10:27:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:27:57,415 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-09-13 10:27:57,415 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:27:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-09-13 10:27:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-13 10:27:57,415 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:27:57,416 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:27:57,428 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 10:27:57,619 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:27:57,620 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-13 10:27:57,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:27:57,621 INFO L85 PathProgramCache]: Analyzing trace with hash 884822851, now seen corresponding path program 1 times [2024-09-13 10:27:57,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:27:57,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123159976] [2024-09-13 10:27:57,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:27:57,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:27:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:57,674 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:27:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:57,711 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 10:27:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:57,746 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 10:27:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-13 10:27:57,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:27:57,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123159976] [2024-09-13 10:27:57,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123159976] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:27:57,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918454669] [2024-09-13 10:27:57,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:27:57,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:27:57,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:27:57,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:27:57,765 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 10:27:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:27:57,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-13 10:27:57,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:27:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-13 10:27:57,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:27:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-13 10:27:57,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918454669] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 10:27:57,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 10:27:57,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 11] total 15 [2024-09-13 10:27:57,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723165342] [2024-09-13 10:27:57,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:27:57,991 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:27:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:27:57,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:27:57,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-09-13 10:27:57,992 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:27:58,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:27:58,008 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-09-13 10:27:58,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:27:58,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-09-13 10:27:58,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:27:58,009 INFO L225 Difference]: With dead ends: 32 [2024-09-13 10:27:58,009 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 10:27:58,009 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-09-13 10:27:58,010 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:27:58,010 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:27:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 10:27:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 10:27:58,014 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) [2024-09-13 10:27:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 10:27:58,014 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2024-09-13 10:27:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:27:58,015 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 10:27:58,015 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:27:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 10:27:58,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 10:27:58,017 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-09-13 10:27:58,017 INFO L785 garLoopResultBuilder]: Registering result SAFE for location idErr0ENSURES_VIOLATIONPOST_CONDITION (0 of 2 remaining) [2024-09-13 10:27:58,046 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 10:27:58,218 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:27:58,221 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:27:58,223 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 10:27:58,225 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 10:27:58 BoogieIcfgContainer [2024-09-13 10:27:58,225 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 10:27:58,225 INFO L158 Benchmark]: Toolchain (without parser) took 3196.34ms. Allocated memory is still 222.3MB. Free memory was 149.2MB in the beginning and 80.2MB in the end (delta: 69.0MB). Peak memory consumption was 68.7MB. Max. memory is 16.1GB. [2024-09-13 10:27:58,225 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 119.5MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:27:58,225 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 222.3MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:27:58,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.09ms. Allocated memory is still 222.3MB. Free memory was 148.8MB in the beginning and 136.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 10:27:58,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.92ms. Allocated memory is still 222.3MB. Free memory was 136.1MB in the beginning and 134.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 10:27:58,226 INFO L158 Benchmark]: Boogie Preprocessor took 34.92ms. Allocated memory is still 222.3MB. Free memory was 134.5MB in the beginning and 133.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:27:58,226 INFO L158 Benchmark]: RCFGBuilder took 291.29ms. Allocated memory is still 222.3MB. Free memory was 132.8MB in the beginning and 120.8MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-13 10:27:58,226 INFO L158 Benchmark]: TraceAbstraction took 2624.24ms. Allocated memory is still 222.3MB. Free memory was 120.2MB in the beginning and 80.2MB in the end (delta: 40.0MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2024-09-13 10:27:58,228 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 119.5MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.17ms. Allocated memory is still 222.3MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.09ms. Allocated memory is still 222.3MB. Free memory was 148.8MB in the beginning and 136.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.92ms. Allocated memory is still 222.3MB. Free memory was 136.1MB in the beginning and 134.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.92ms. Allocated memory is still 222.3MB. Free memory was 134.5MB in the beginning and 133.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 291.29ms. Allocated memory is still 222.3MB. Free memory was 132.8MB in the beginning and 120.8MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2624.24ms. Allocated memory is still 222.3MB. Free memory was 120.2MB in the beginning and 80.2MB in the end (delta: 40.0MB). Peak memory consumption was 39.3MB. 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: 27]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 9]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 794 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 598 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 196 mSDtfsCounter, 191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=7, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 431 SizeOfPredicates, 0 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 37/43 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 10:27:58,251 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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