This is Ultimate 0.2.4-dev-1d5fa63-m [2024-09-13 10:12:15,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 10:12:15,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 10:12:15,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 10:12:15,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 10:12:15,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 10:12:15,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 10:12:15,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 10:12:15,336 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 10:12:15,336 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 10:12:15,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 10:12:15,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 10:12:15,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 10:12:15,337 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 10:12:15,337 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 10:12:15,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 10:12:15,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 10:12:15,338 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 10:12:15,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 10:12:15,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 10:12:15,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 10:12:15,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 10:12:15,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 10:12:15,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 10:12:15,340 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 10:12:15,341 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 10:12:15,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 10:12:15,341 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 10:12:15,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 10:12:15,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 10:12:15,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 10:12:15,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 10:12:15,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:12:15,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 10:12:15,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 10:12:15,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 10:12:15,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 10:12:15,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 10:12:15,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 10:12:15,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 10:12:15,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 10:12:15,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 10:12:15,348 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:12:15,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 10:12:15,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 10:12:15,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 10:12:15,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 10:12:15,590 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 10:12:15,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2024-09-13 10:12:16,841 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 10:12:16,996 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 10:12:16,996 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2024-09-13 10:12:17,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d97067076/4265b36ccb0b49d5885a7e8e73f5d6c5/FLAGd34b6e111 [2024-09-13 10:12:17,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d97067076/4265b36ccb0b49d5885a7e8e73f5d6c5 [2024-09-13 10:12:17,429 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 10:12:17,433 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 10:12:17,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/SpamAssassin-loop.yml/witness-2.1.yml [2024-09-13 10:12:17,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 10:12:17,498 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 10:12:17,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 10:12:17,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 10:12:17,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 10:12:17,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:12:17" (1/2) ... [2024-09-13 10:12:17,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b7bd3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:17, skipping insertion in model container [2024-09-13 10:12:17,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:12:17" (1/2) ... [2024-09-13 10:12:17,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7352407a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:12:17, skipping insertion in model container [2024-09-13 10:12:17,508 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:12:17" (2/2) ... [2024-09-13 10:12:17,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b7bd3b and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:12:17, skipping insertion in model container [2024-09-13 10:12:17,508 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:12:17" (2/2) ... [2024-09-13 10:12:17,519 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 10:12:17,521 INFO L1541 ArrayList]: Loop invariant at [L35-L64] (((0 <= j) && (0 <= i)) && (((long long) limit + 4) <= bufsize)) [2024-09-13 10:12:17,521 INFO L1541 ArrayList]: Location invariant before [L56-L57] (((((((long long) i + 1) <= len) && (0 <= j)) && ((5 + j) <= bufsize)) && (0 <= i)) && (((long long) limit + 4) <= bufsize)) [2024-09-13 10:12:17,521 INFO L1541 ArrayList]: Loop invariant at [L34-L65] ((0 <= i) && (((long long) limit + 4) <= bufsize)) [2024-09-13 10:12:17,522 INFO L1541 ArrayList]: Function contract at [L17]: requires (\old(cond) != 0), ensures (\old(cond) != 0) [2024-09-13 10:12:17,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 10:12:17,647 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/loop-invgen/SpamAssassin-loop.i[893,906] [2024-09-13 10:12:17,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:12:17,670 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global [2024-09-13 10:12:17,696 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/loop-invgen/SpamAssassin-loop.i[893,906] Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-13 10:12:17,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:12:17,720 INFO L204 MainTranslator]: Completed translation [2024-09-13 10:12:17,720 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:12:17 WrapperNode [2024-09-13 10:12:17,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 10:12:17,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 10:12:17,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 10:12:17,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 10:12:17,726 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:12:17" (1/1) ... [2024-09-13 10:12:17,731 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:12:17" (1/1) ... [2024-09-13 10:12:17,744 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 83 [2024-09-13 10:12:17,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 10:12:17,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 10:12:17,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 10:12:17,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 10:12:17,753 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:12:17" (1/1) ... [2024-09-13 10:12:17,753 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:12:17" (1/1) ... [2024-09-13 10:12:17,754 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:12:17" (1/1) ... [2024-09-13 10:12:17,764 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure __VERIFIER_assert is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-13 10:12:17,767 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:12:17" (1/1) ... [2024-09-13 10:12:17,767 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:12:17" (1/1) ... [2024-09-13 10:12:17,769 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:12:17" (1/1) ... [2024-09-13 10:12:17,771 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:12:17" (1/1) ... [2024-09-13 10:12:17,772 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:12:17" (1/1) ... [2024-09-13 10:12:17,772 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:12:17" (1/1) ... [2024-09-13 10:12:17,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 10:12:17,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 10:12:17,776 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 10:12:17,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 10:12:17,777 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:12:17" (1/1) ... [2024-09-13 10:12:17,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:12:17,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:12:17,804 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:12:17,807 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:12:17,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 10:12:17,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 10:12:17,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 10:12:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 10:12:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 10:12:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 10:12:17,894 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 10:12:17,895 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 10:12:18,033 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 10:12:18,054 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-09-13 10:12:18,055 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 10:12:18,079 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 10:12:18,080 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 10:12:18,080 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:12:18 BoogieIcfgContainer [2024-09-13 10:12:18,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 10:12:18,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 10:12:18,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 10:12:18,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 10:12:18,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 10:12:17" (1/4) ... [2024-09-13 10:12:18,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be8b762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:12:18, skipping insertion in model container [2024-09-13 10:12:18,089 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:12:17" (2/4) ... [2024-09-13 10:12:18,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be8b762 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 10:12:18, skipping insertion in model container [2024-09-13 10:12:18,091 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:12:17" (3/4) ... [2024-09-13 10:12:18,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be8b762 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 10:12:18, skipping insertion in model container [2024-09-13 10:12:18,091 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:12:18" (4/4) ... [2024-09-13 10:12:18,092 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2024-09-13 10:12:18,104 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 10:12:18,104 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-09-13 10:12:18,143 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 10:12:18,148 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;@57ff8ea3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 10:12:18,149 INFO L337 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-09-13 10:12:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 41 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-13 10:12:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-09-13 10:12:18,155 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:18,157 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-09-13 10:12:18,158 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 18 more)] === [2024-09-13 10:12:18,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:18,163 INFO L85 PathProgramCache]: Analyzing trace with hash 159752, now seen corresponding path program 1 times [2024-09-13 10:12:18,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:18,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004489440] [2024-09-13 10:12:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:18,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:18,316 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:12:18,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:18,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004489440] [2024-09-13 10:12:18,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004489440] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:18,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:12:18,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215961243] [2024-09-13 10:12:18,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:18,323 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:12:18,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:18,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:12:18,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:12:18,346 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 41 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:12:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:18,428 INFO L93 Difference]: Finished difference Result 81 states and 121 transitions. [2024-09-13 10:12:18,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:12:18,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2024-09-13 10:12:18,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:18,435 INFO L225 Difference]: With dead ends: 81 [2024-09-13 10:12:18,435 INFO L226 Difference]: Without dead ends: 78 [2024-09-13 10:12:18,437 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:12:18,441 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:18,442 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 103 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:12:18,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-13 10:12:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2024-09-13 10:12:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.288888888888889) internal successors, (58), 48 states have internal predecessors, (58), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-13 10:12:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2024-09-13 10:12:18,475 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 3 [2024-09-13 10:12:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:18,475 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2024-09-13 10:12:18,475 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:12:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2024-09-13 10:12:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 10:12:18,476 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:18,476 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 10:12:18,476 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 10:12:18,477 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 18 more)] === [2024-09-13 10:12:18,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:18,478 INFO L85 PathProgramCache]: Analyzing trace with hash 153523179, now seen corresponding path program 1 times [2024-09-13 10:12:18,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:18,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551373632] [2024-09-13 10:12:18,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:18,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:18,556 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:12:18,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:18,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551373632] [2024-09-13 10:12:18,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551373632] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:18,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:18,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:12:18,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872635569] [2024-09-13 10:12:18,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:18,558 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:18,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:18,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:18,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:18,559 INFO L87 Difference]: Start difference. First operand 70 states and 102 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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:12:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:18,639 INFO L93 Difference]: Finished difference Result 76 states and 113 transitions. [2024-09-13 10:12:18,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:18,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) Word has length 5 [2024-09-13 10:12:18,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:18,641 INFO L225 Difference]: With dead ends: 76 [2024-09-13 10:12:18,641 INFO L226 Difference]: Without dead ends: 76 [2024-09-13 10:12:18,641 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:18,642 INFO L434 NwaCegarLoop]: 56 mSDtfsCounter, 17 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:18,642 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:12:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-13 10:12:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-09-13 10:12:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-09-13 10:12:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2024-09-13 10:12:18,658 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 5 [2024-09-13 10:12:18,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:18,659 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2024-09-13 10:12:18,659 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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:12:18,659 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2024-09-13 10:12:18,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-13 10:12:18,660 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:18,660 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:18,661 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 10:12:18,661 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 18 more)] === [2024-09-13 10:12:18,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:18,661 INFO L85 PathProgramCache]: Analyzing trace with hash -531086760, now seen corresponding path program 1 times [2024-09-13 10:12:18,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:18,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245840434] [2024-09-13 10:12:18,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:18,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:18,827 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:12:18,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:18,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245840434] [2024-09-13 10:12:18,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245840434] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:18,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:18,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:18,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647985578] [2024-09-13 10:12:18,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:18,828 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:12:18,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:18,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:12:18,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:12:18,829 INFO L87 Difference]: Start difference. First operand 74 states and 111 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:12:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:18,969 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2024-09-13 10:12:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:12:18,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) Word has length 8 [2024-09-13 10:12:18,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:18,971 INFO L225 Difference]: With dead ends: 76 [2024-09-13 10:12:18,971 INFO L226 Difference]: Without dead ends: 76 [2024-09-13 10:12:18,971 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:12:18,972 INFO L434 NwaCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:18,972 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 105 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:12:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-13 10:12:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-09-13 10:12:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 43 states have (on average 1.255813953488372) internal successors, (54), 48 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-09-13 10:12:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 106 transitions. [2024-09-13 10:12:18,978 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 106 transitions. Word has length 8 [2024-09-13 10:12:18,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:18,978 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 106 transitions. [2024-09-13 10:12:18,978 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:12:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2024-09-13 10:12:18,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-13 10:12:18,979 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:18,979 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:18,979 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 10:12:18,979 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 18 more)] === [2024-09-13 10:12:18,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:18,979 INFO L85 PathProgramCache]: Analyzing trace with hash -531087951, now seen corresponding path program 1 times [2024-09-13 10:12:18,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:18,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613775040] [2024-09-13 10:12:18,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:18,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:19,007 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:12:19,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:19,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613775040] [2024-09-13 10:12:19,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613775040] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:19,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:19,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:12:19,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940544083] [2024-09-13 10:12:19,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:19,008 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:12:19,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:19,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:12:19,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:12:19,009 INFO L87 Difference]: Start difference. First operand 74 states and 106 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:12:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:19,042 INFO L93 Difference]: Finished difference Result 85 states and 126 transitions. [2024-09-13 10:12:19,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:12:19,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2024-09-13 10:12:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:19,044 INFO L225 Difference]: With dead ends: 85 [2024-09-13 10:12:19,045 INFO L226 Difference]: Without dead ends: 85 [2024-09-13 10:12:19,045 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:12:19,046 INFO L434 NwaCegarLoop]: 75 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:19,046 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 117 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:12:19,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-09-13 10:12:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2024-09-13 10:12:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-13 10:12:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 107 transitions. [2024-09-13 10:12:19,052 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 107 transitions. Word has length 8 [2024-09-13 10:12:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:19,052 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 107 transitions. [2024-09-13 10:12:19,052 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:12:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 107 transitions. [2024-09-13 10:12:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-13 10:12:19,053 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:19,053 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:19,053 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 10:12:19,053 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 18 more)] === [2024-09-13 10:12:19,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:19,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1020620212, now seen corresponding path program 1 times [2024-09-13 10:12:19,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:19,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884832704] [2024-09-13 10:12:19,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:19,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:19,071 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:12:19,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:19,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884832704] [2024-09-13 10:12:19,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884832704] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:19,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:19,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:12:19,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038498735] [2024-09-13 10:12:19,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:19,072 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:12:19,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:19,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:12:19,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:12:19,075 INFO L87 Difference]: Start difference. First operand 74 states and 107 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:12:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:19,140 INFO L93 Difference]: Finished difference Result 73 states and 106 transitions. [2024-09-13 10:12:19,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:12:19,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-09-13 10:12:19,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:19,141 INFO L225 Difference]: With dead ends: 73 [2024-09-13 10:12:19,141 INFO L226 Difference]: Without dead ends: 73 [2024-09-13 10:12:19,141 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:12:19,142 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 3 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:19,142 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:12:19,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-13 10:12:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-09-13 10:12:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 47 states have internal predecessors, (52), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-13 10:12:19,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2024-09-13 10:12:19,148 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 11 [2024-09-13 10:12:19,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:19,148 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2024-09-13 10:12:19,149 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:12:19,149 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2024-09-13 10:12:19,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-13 10:12:19,149 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:19,149 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:19,149 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 10:12:19,149 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 18 more)] === [2024-09-13 10:12:19,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:19,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1020620051, now seen corresponding path program 1 times [2024-09-13 10:12:19,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:19,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259192659] [2024-09-13 10:12:19,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:19,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:19,185 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:12:19,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:19,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259192659] [2024-09-13 10:12:19,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259192659] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:19,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:19,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:12:19,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933927396] [2024-09-13 10:12:19,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:19,186 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:12:19,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:19,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:12:19,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:12:19,187 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:12:19,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:19,199 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. [2024-09-13 10:12:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:12:19,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-09-13 10:12:19,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:19,200 INFO L225 Difference]: With dead ends: 71 [2024-09-13 10:12:19,200 INFO L226 Difference]: Without dead ends: 71 [2024-09-13 10:12:19,200 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:12:19,201 INFO L434 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 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:12:19,201 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:12:19,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-13 10:12:19,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-09-13 10:12:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.25) internal successors, (50), 45 states have internal predecessors, (50), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-13 10:12:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 104 transitions. [2024-09-13 10:12:19,212 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 104 transitions. Word has length 11 [2024-09-13 10:12:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:19,212 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 104 transitions. [2024-09-13 10:12:19,212 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:12:19,212 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 104 transitions. [2024-09-13 10:12:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-13 10:12:19,213 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:19,213 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:19,213 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 10:12:19,213 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 18 more)] === [2024-09-13 10:12:19,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:19,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2039693274, now seen corresponding path program 1 times [2024-09-13 10:12:19,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:19,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999911119] [2024-09-13 10:12:19,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:19,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:19,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 10:12:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:19,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-13 10:12:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:19,336 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-13 10:12:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:19,341 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 10:12:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 10:12:19,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:19,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999911119] [2024-09-13 10:12:19,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999911119] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:12:19,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886810930] [2024-09-13 10:12:19,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:19,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:12:19,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:12:19,349 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:12:19,351 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:12:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:19,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-13 10:12:19,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:12:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 10:12:19,496 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 10:12:19,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886810930] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:19,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 10:12:19,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-09-13 10:12:19,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108221144] [2024-09-13 10:12:19,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:19,497 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:12:19,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:19,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:12:19,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:12:19,498 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 10:12:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:19,595 INFO L93 Difference]: Finished difference Result 81 states and 133 transitions. [2024-09-13 10:12:19,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:12:19,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2024-09-13 10:12:19,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:19,596 INFO L225 Difference]: With dead ends: 81 [2024-09-13 10:12:19,596 INFO L226 Difference]: Without dead ends: 81 [2024-09-13 10:12:19,596 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:12:19,597 INFO L434 NwaCegarLoop]: 61 mSDtfsCounter, 13 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:19,597 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 120 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:12:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-13 10:12:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2024-09-13 10:12:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.25) internal successors, (40), 35 states have internal predecessors, (40), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-13 10:12:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2024-09-13 10:12:19,603 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 30 [2024-09-13 10:12:19,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:19,603 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2024-09-13 10:12:19,603 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 10:12:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2024-09-13 10:12:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-13 10:12:19,604 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:19,604 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:19,617 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:12:19,807 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-13 10:12:19,807 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 18 more)] === [2024-09-13 10:12:19,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:19,807 INFO L85 PathProgramCache]: Analyzing trace with hash 695035965, now seen corresponding path program 1 times [2024-09-13 10:12:19,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:19,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103961534] [2024-09-13 10:12:19,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:19,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:19,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 10:12:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:19,922 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-13 10:12:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:19,926 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-13 10:12:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:19,934 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 10:12:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-13 10:12:19,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:19,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103961534] [2024-09-13 10:12:19,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103961534] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:19,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:19,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:19,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937071875] [2024-09-13 10:12:19,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:19,941 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:12:19,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:19,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:12:19,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:12:19,943 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 10:12:20,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:20,019 INFO L93 Difference]: Finished difference Result 56 states and 86 transitions. [2024-09-13 10:12:20,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:12:20,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2024-09-13 10:12:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:20,020 INFO L225 Difference]: With dead ends: 56 [2024-09-13 10:12:20,022 INFO L226 Difference]: Without dead ends: 56 [2024-09-13 10:12:20,023 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:12:20,023 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 19 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:20,024 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 57 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:12:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-13 10:12:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 37. [2024-09-13 10:12:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-13 10:12:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2024-09-13 10:12:20,034 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 33 [2024-09-13 10:12:20,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:20,034 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2024-09-13 10:12:20,034 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 10:12:20,034 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2024-09-13 10:12:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-13 10:12:20,035 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:20,035 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:20,036 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 10:12:20,036 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 18 more)] === [2024-09-13 10:12:20,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:20,036 INFO L85 PathProgramCache]: Analyzing trace with hash 393607650, now seen corresponding path program 1 times [2024-09-13 10:12:20,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:20,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42016736] [2024-09-13 10:12:20,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:20,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:12:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,098 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:12:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,102 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-13 10:12:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,105 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-13 10:12:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-13 10:12:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,115 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-13 10:12:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-13 10:12:20,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:20,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42016736] [2024-09-13 10:12:20,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42016736] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:20,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:20,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:12:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029329933] [2024-09-13 10:12:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:20,122 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:12:20,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:20,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:12:20,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:20,123 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-13 10:12:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:20,170 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2024-09-13 10:12:20,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:12:20,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2024-09-13 10:12:20,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:20,171 INFO L225 Difference]: With dead ends: 46 [2024-09-13 10:12:20,171 INFO L226 Difference]: Without dead ends: 46 [2024-09-13 10:12:20,171 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:12:20,172 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:20,172 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 78 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:12:20,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-13 10:12:20,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2024-09-13 10:12:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-13 10:12:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions. [2024-09-13 10:12:20,182 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 54 transitions. Word has length 41 [2024-09-13 10:12:20,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:20,182 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 54 transitions. [2024-09-13 10:12:20,182 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-13 10:12:20,182 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 54 transitions. [2024-09-13 10:12:20,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-13 10:12:20,184 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:20,184 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:20,185 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-13 10:12:20,186 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 18 more)] === [2024-09-13 10:12:20,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:20,186 INFO L85 PathProgramCache]: Analyzing trace with hash -76326110, now seen corresponding path program 1 times [2024-09-13 10:12:20,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:20,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764005642] [2024-09-13 10:12:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:20,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,255 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:12:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,259 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:12:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,264 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-13 10:12:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,270 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-13 10:12:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,273 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-13 10:12:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,277 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-13 10:12:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,281 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 10:12:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,289 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 10:12:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-09-13 10:12:20,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:20,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764005642] [2024-09-13 10:12:20,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764005642] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:20,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:20,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:12:20,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107733449] [2024-09-13 10:12:20,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:20,296 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:12:20,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:20,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:12:20,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:12:20,297 INFO L87 Difference]: Start difference. First operand 36 states and 54 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-13 10:12:20,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:20,361 INFO L93 Difference]: Finished difference Result 37 states and 56 transitions. [2024-09-13 10:12:20,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:12:20,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2024-09-13 10:12:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:20,362 INFO L225 Difference]: With dead ends: 37 [2024-09-13 10:12:20,362 INFO L226 Difference]: Without dead ends: 37 [2024-09-13 10:12:20,362 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:12:20,363 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 19 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:20,363 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 78 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:12:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-13 10:12:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-09-13 10:12:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-13 10:12:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2024-09-13 10:12:20,368 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 51 [2024-09-13 10:12:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:20,368 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2024-09-13 10:12:20,368 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-13 10:12:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2024-09-13 10:12:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-09-13 10:12:20,369 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:12:20,369 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:20,369 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-13 10:12:20,369 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 18 more)] === [2024-09-13 10:12:20,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:12:20,373 INFO L85 PathProgramCache]: Analyzing trace with hash -838135813, now seen corresponding path program 1 times [2024-09-13 10:12:20,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:12:20,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830162792] [2024-09-13 10:12:20,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:12:20,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:12:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:12:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,449 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:12:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-13 10:12:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,455 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-13 10:12:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,457 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-13 10:12:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-13 10:12:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 10:12:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,464 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 10:12:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 10:12:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-13 10:12:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:12:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-09-13 10:12:20,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:12:20,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830162792] [2024-09-13 10:12:20,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830162792] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:12:20,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:12:20,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 10:12:20,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126766566] [2024-09-13 10:12:20,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:12:20,471 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 10:12:20,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:12:20,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 10:12:20,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-13 10:12:20,472 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-13 10:12:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:12:20,544 INFO L93 Difference]: Finished difference Result 36 states and 55 transitions. [2024-09-13 10:12:20,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 10:12:20,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 62 [2024-09-13 10:12:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:12:20,545 INFO L225 Difference]: With dead ends: 36 [2024-09-13 10:12:20,545 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 10:12:20,546 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-09-13 10:12:20,546 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 16 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:12:20,546 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 113 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:12:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 10:12:20,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 10:12:20,547 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:12:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 10:12:20,547 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2024-09-13 10:12:20,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:12:20,547 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 10:12:20,547 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-13 10:12:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 10:12:20,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 10:12:20,550 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 21 remaining) [2024-09-13 10:12:20,550 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 21 remaining) [2024-09-13 10:12:20,550 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (18 of 21 remaining) [2024-09-13 10:12:20,550 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (17 of 21 remaining) [2024-09-13 10:12:20,550 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION (16 of 21 remaining) [2024-09-13 10:12:20,550 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (15 of 21 remaining) [2024-09-13 10:12:20,551 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION (14 of 21 remaining) [2024-09-13 10:12:20,551 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION (13 of 21 remaining) [2024-09-13 10:12:20,551 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION (12 of 21 remaining) [2024-09-13 10:12:20,551 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION (11 of 21 remaining) [2024-09-13 10:12:20,551 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONPRE_CONDITION (10 of 21 remaining) [2024-09-13 10:12:20,551 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONPRE_CONDITION (9 of 21 remaining) [2024-09-13 10:12:20,551 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONPRE_CONDITION (8 of 21 remaining) [2024-09-13 10:12:20,551 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONPRE_CONDITION (7 of 21 remaining) [2024-09-13 10:12:20,551 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 21 remaining) [2024-09-13 10:12:20,552 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONPRE_CONDITION (5 of 21 remaining) [2024-09-13 10:12:20,552 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONPRE_CONDITION (4 of 21 remaining) [2024-09-13 10:12:20,552 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONPRE_CONDITION (3 of 21 remaining) [2024-09-13 10:12:20,552 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONPRE_CONDITION (2 of 21 remaining) [2024-09-13 10:12:20,552 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 21 remaining) [2024-09-13 10:12:20,552 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 21 remaining) [2024-09-13 10:12:20,552 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-13 10:12:20,555 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:12:20,556 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 10:12:20,557 INFO L469 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-09-13 10:12:20,558 INFO L470 ceAbstractionStarter]: WitnessConsidered=3 [2024-09-13 10:12:20,558 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 10:12:20 BoogieIcfgContainer [2024-09-13 10:12:20,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 10:12:20,559 INFO L158 Benchmark]: Toolchain (without parser) took 3060.82ms. Allocated memory was 182.5MB in the beginning and 249.6MB in the end (delta: 67.1MB). Free memory was 152.0MB in the beginning and 110.2MB in the end (delta: 41.8MB). Peak memory consumption was 109.6MB. Max. memory is 16.1GB. [2024-09-13 10:12:20,559 INFO L158 Benchmark]: CDTParser took 2.42ms. Allocated memory is still 182.5MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:12:20,559 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 182.5MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:12:20,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.97ms. Allocated memory is still 182.5MB. Free memory was 151.2MB in the beginning and 137.2MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 10:12:20,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.39ms. Allocated memory is still 182.5MB. Free memory was 137.2MB in the beginning and 135.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:12:20,560 INFO L158 Benchmark]: Boogie Preprocessor took 30.65ms. Allocated memory is still 182.5MB. Free memory was 135.9MB in the beginning and 133.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 10:12:20,560 INFO L158 Benchmark]: RCFGBuilder took 303.79ms. Allocated memory is still 182.5MB. Free memory was 133.8MB in the beginning and 117.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-09-13 10:12:20,560 INFO L158 Benchmark]: TraceAbstraction took 2474.54ms. Allocated memory was 182.5MB in the beginning and 249.6MB in the end (delta: 67.1MB). Free memory was 116.3MB in the beginning and 110.2MB in the end (delta: 6.1MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2024-09-13 10:12:20,561 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.42ms. Allocated memory is still 182.5MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.16ms. Allocated memory is still 182.5MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.97ms. Allocated memory is still 182.5MB. Free memory was 151.2MB in the beginning and 137.2MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.39ms. Allocated memory is still 182.5MB. Free memory was 137.2MB in the beginning and 135.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.65ms. Allocated memory is still 182.5MB. Free memory was 135.9MB in the beginning and 133.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 303.79ms. Allocated memory is still 182.5MB. Free memory was 133.8MB in the beginning and 117.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2474.54ms. Allocated memory was 182.5MB in the beginning and 249.6MB in the end (delta: 67.1MB). Free memory was 116.3MB in the beginning and 110.2MB in the end (delta: 6.1MB). Peak memory consumption was 74.0MB. 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: 34]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 35]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 56]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 19]: 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: 17]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 11, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 226 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 1081 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 485 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 488 IncrementalHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 596 mSDtfsCounter, 488 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=2, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 76 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 281 ConstructedInterpolants, 0 QuantifiedInterpolants, 948 SizeOfPredicates, 0 NumberOfNonLiveVariables, 87 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 429/430 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 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 10:12:20,584 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...