This is Ultimate 0.2.4-dev-1d5fa63-m [2024-09-13 10:15:20,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 10:15:20,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 10:15:20,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 10:15:20,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 10:15:20,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 10:15:20,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 10:15:20,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 10:15:20,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 10:15:20,551 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 10:15:20,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 10:15:20,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 10:15:20,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 10:15:20,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 10:15:20,554 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 10:15:20,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 10:15:20,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 10:15:20,555 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 10:15:20,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 10:15:20,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 10:15:20,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 10:15:20,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 10:15:20,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 10:15:20,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 10:15:20,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 10:15:20,560 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 10:15:20,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 10:15:20,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 10:15:20,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 10:15:20,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 10:15:20,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 10:15:20,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 10:15:20,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:15:20,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 10:15:20,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 10:15:20,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 10:15:20,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 10:15:20,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 10:15:20,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 10:15:20,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 10:15:20,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 10:15:20,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 10:15:20,564 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:15:20,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 10:15:20,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 10:15:20,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 10:15:20,829 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 10:15:20,829 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 10:15:20,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/cohendiv-ll_unwindbound1.yml/witness-2.1.yml [2024-09-13 10:15:20,880 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 10:15:20,881 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 10:15:20,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound1.c [2024-09-13 10:15:22,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 10:15:22,485 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 10:15:22,485 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound1.c [2024-09-13 10:15:22,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/0c1f9fa97/dea620d29d564b9d83dfaa393d077f2b/FLAG0044122c7 [2024-09-13 10:15:22,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/0c1f9fa97/dea620d29d564b9d83dfaa393d077f2b [2024-09-13 10:15:22,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 10:15:22,514 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 10:15:22,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 10:15:22,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 10:15:22,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 10:15:22,522 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:15:20" (1/2) ... [2024-09-13 10:15:22,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@140517ce and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:15:22, skipping insertion in model container [2024-09-13 10:15:22,526 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:15:20" (1/2) ... [2024-09-13 10:15:22,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5b3788e5 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:15:22, skipping insertion in model container [2024-09-13 10:15:22,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:15:22" (2/2) ... [2024-09-13 10:15:22,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@140517ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:15:22, skipping insertion in model container [2024-09-13 10:15:22,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:15:22" (2/2) ... [2024-09-13 10:15:22,539 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 10:15:22,540 INFO L1541 ArrayList]: Loop invariant at [L46-L58] (((((((__int128) q * y) + r) == x) && (1 <= counter)) && (((((__int128) q * y) + r) + ((__int128) a * y)) == (b + x))) && (\old(counter) == 0)) [2024-09-13 10:15:22,540 INFO L1541 ArrayList]: Loop invariant at [L37-L61] ((((((((__int128) q * y) + r) == x) && (1 <= counter)) && (((((__int128) q * y) + r) + ((__int128) a * y)) == (b + x))) || (((((a == 0) && (x == r)) && (b == 0)) && (counter == 0)) && (q == 0))) && (\old(counter) == 0)) [2024-09-13 10:15:22,540 INFO L1541 ArrayList]: Function contract at [L23]: requires (counter == 0), ensures (\old(counter) == 0) [2024-09-13 10:15:22,540 INFO L1541 ArrayList]: Function contract at [L11]: requires (counter == 0), ensures (counter == 0) [2024-09-13 10:15:22,540 INFO L1541 ArrayList]: Function contract at [L14]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-13 10:15:22,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 10:15:22,730 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/nla-digbench-scaling/cohendiv-ll_unwindbound1.c[576,589] [2024-09-13 10:15:22,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:15:22,768 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 10:15:22,808 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/nla-digbench-scaling/cohendiv-ll_unwindbound1.c[576,589] Start Parsing Global Start Parsing Global Start Parsing Local Start Parsing Local [2024-09-13 10:15:22,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:15:22,843 INFO L204 MainTranslator]: Completed translation [2024-09-13 10:15:22,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:15:22 WrapperNode [2024-09-13 10:15:22,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 10:15:22,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 10:15:22,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 10:15:22,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 10:15:22,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:15:22" (1/1) ... [2024-09-13 10:15:22,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:15:22" (1/1) ... [2024-09-13 10:15:22,885 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2024-09-13 10:15:22,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 10:15:22,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 10:15:22,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 10:15:22,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 10:15:22,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:15:22" (1/1) ... [2024-09-13 10:15:22,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:15:22" (1/1) ... [2024-09-13 10:15:22,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:15:22" (1/1) ... [2024-09-13 10:15:22,915 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:15:22,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:15:22" (1/1) ... [2024-09-13 10:15:22,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:15:22" (1/1) ... [2024-09-13 10:15:22,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:15:22" (1/1) ... [2024-09-13 10:15:22,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:15:22" (1/1) ... [2024-09-13 10:15:22,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:15:22" (1/1) ... [2024-09-13 10:15:22,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:15:22" (1/1) ... [2024-09-13 10:15:22,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 10:15:22,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 10:15:22,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 10:15:22,933 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 10:15:22,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:15:22" (1/1) ... [2024-09-13 10:15:22,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:15:22,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:15:22,970 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:15:22,972 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:15:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 10:15:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 10:15:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 10:15:23,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 10:15:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 10:15:23,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 10:15:23,079 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 10:15:23,080 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 10:15:23,258 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 10:15:23,288 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-09-13 10:15:23,288 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 10:15:23,314 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 10:15:23,314 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 10:15:23,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:15:23 BoogieIcfgContainer [2024-09-13 10:15:23,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 10:15:23,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 10:15:23,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 10:15:23,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 10:15:23,322 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:15:20" (1/4) ... [2024-09-13 10:15:23,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29078bdd and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 10:15:23, skipping insertion in model container [2024-09-13 10:15:23,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 10:15:22" (2/4) ... [2024-09-13 10:15:23,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29078bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:15:23, skipping insertion in model container [2024-09-13 10:15:23,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:15:22" (3/4) ... [2024-09-13 10:15:23,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29078bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:15:23, skipping insertion in model container [2024-09-13 10:15:23,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:15:23" (4/4) ... [2024-09-13 10:15:23,325 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound1.c [2024-09-13 10:15:23,362 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 10:15:23,362 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-09-13 10:15:23,422 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 10:15:23,431 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;@53a4c890, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 10:15:23,431 INFO L337 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-09-13 10:15:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 10:15:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-09-13 10:15:23,443 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:15:23,444 INFO L216 NwaCegarLoop]: trace histogram [1, 1] [2024-09-13 10:15:23,445 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONPOST_CONDITION (and 12 more)] === [2024-09-13 10:15:23,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:15:23,454 INFO L85 PathProgramCache]: Analyzing trace with hash 4157, now seen corresponding path program 1 times [2024-09-13 10:15:23,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:15:23,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475217855] [2024-09-13 10:15:23,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:15:23,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:15:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:23,588 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:15:23,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:15:23,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475217855] [2024-09-13 10:15:23,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475217855] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:15:23,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:15:23,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-13 10:15:23,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672091876] [2024-09-13 10:15:23,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:15:23,596 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:15:23,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:15:23,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:15:23,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:15:23,632 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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:15:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:15:23,695 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2024-09-13 10:15:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:15:23,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-09-13 10:15:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:15:23,702 INFO L225 Difference]: With dead ends: 45 [2024-09-13 10:15:23,702 INFO L226 Difference]: Without dead ends: 44 [2024-09-13 10:15:23,704 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:15:23,707 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:15:23,708 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 80 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:15:23,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-13 10:15:23,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2024-09-13 10:15:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 10:15:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2024-09-13 10:15:23,741 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 2 [2024-09-13 10:15:23,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:15:23,742 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2024-09-13 10:15:23,742 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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:15:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-09-13 10:15:23,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-09-13 10:15:23,743 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:15:23,743 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-09-13 10:15:23,743 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 10:15:23,744 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONPOST_CONDITION (and 12 more)] === [2024-09-13 10:15:23,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:15:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash -454777211, now seen corresponding path program 1 times [2024-09-13 10:15:23,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:15:23,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932839838] [2024-09-13 10:15:23,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:15:23,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:15:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:23,998 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:15:23,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:15:23,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932839838] [2024-09-13 10:15:23,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932839838] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:15:24,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:15:24,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:15:24,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230467653] [2024-09-13 10:15:24,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:15:24,002 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:15:24,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:15:24,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:15:24,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:15:24,005 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:15:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:15:24,044 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-09-13 10:15:24,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:15:24,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-09-13 10:15:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:15:24,047 INFO L225 Difference]: With dead ends: 43 [2024-09-13 10:15:24,048 INFO L226 Difference]: Without dead ends: 43 [2024-09-13 10:15:24,048 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:15:24,049 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:15:24,049 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:15:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-13 10:15:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-09-13 10:15:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 33 states have internal predecessors, (37), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 10:15:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-09-13 10:15:24,063 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 6 [2024-09-13 10:15:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:15:24,064 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-09-13 10:15:24,064 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:15:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-09-13 10:15:24,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-13 10:15:24,065 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:15:24,065 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:15:24,065 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 10:15:24,065 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONPOST_CONDITION (and 12 more)] === [2024-09-13 10:15:24,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:15:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1940990531, now seen corresponding path program 1 times [2024-09-13 10:15:24,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:15:24,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207410610] [2024-09-13 10:15:24,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:15:24,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:15:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:24,169 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:15:24,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:15:24,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207410610] [2024-09-13 10:15:24,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207410610] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:15:24,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:15:24,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:15:24,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583604484] [2024-09-13 10:15:24,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:15:24,171 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:15:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:15:24,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:15:24,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:15:24,172 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:15:24,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:15:24,205 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-09-13 10:15:24,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:15:24,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-09-13 10:15:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:15:24,206 INFO L225 Difference]: With dead ends: 44 [2024-09-13 10:15:24,207 INFO L226 Difference]: Without dead ends: 44 [2024-09-13 10:15:24,207 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:15:24,208 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:15:24,209 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:15:24,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-13 10:15:24,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-09-13 10:15:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 10:15:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-09-13 10:15:24,217 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 9 [2024-09-13 10:15:24,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:15:24,217 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-09-13 10:15:24,217 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:15:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-09-13 10:15:24,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-13 10:15:24,218 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:15:24,218 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:15:24,218 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 10:15:24,219 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONPOST_CONDITION (and 12 more)] === [2024-09-13 10:15:24,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:15:24,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1940990511, now seen corresponding path program 1 times [2024-09-13 10:15:24,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:15:24,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979018181] [2024-09-13 10:15:24,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:15:24,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:15:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:15:24,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210711268] [2024-09-13 10:15:24,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:15:24,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:15:24,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:15:24,248 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:15:24,249 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:15:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:24,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 10:15:24,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:15:24,333 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:15:24,334 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 10:15:24,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:15:24,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979018181] [2024-09-13 10:15:24,335 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:15:24,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210711268] [2024-09-13 10:15:24,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210711268] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:15:24,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:15:24,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:15:24,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181229227] [2024-09-13 10:15:24,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:15:24,336 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:15:24,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:15:24,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:15:24,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:15:24,338 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:15:24,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:15:24,383 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-09-13 10:15:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:15:24,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-09-13 10:15:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:15:24,384 INFO L225 Difference]: With dead ends: 53 [2024-09-13 10:15:24,384 INFO L226 Difference]: Without dead ends: 53 [2024-09-13 10:15:24,385 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:15:24,386 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:15:24,386 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:15:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-13 10:15:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2024-09-13 10:15:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 36 states have internal predecessors, (39), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 10:15:24,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2024-09-13 10:15:24,393 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 9 [2024-09-13 10:15:24,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:15:24,394 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2024-09-13 10:15:24,394 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:15:24,394 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2024-09-13 10:15:24,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-13 10:15:24,395 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:15:24,395 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:15:24,412 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:15:24,595 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:15:24,596 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONPOST_CONDITION (and 12 more)] === [2024-09-13 10:15:24,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:15:24,597 INFO L85 PathProgramCache]: Analyzing trace with hash -901686435, now seen corresponding path program 1 times [2024-09-13 10:15:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:15:24,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486248458] [2024-09-13 10:15:24,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:15:24,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:15:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:24,670 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:15:24,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:15:24,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486248458] [2024-09-13 10:15:24,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486248458] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:15:24,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:15:24,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:15:24,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862456873] [2024-09-13 10:15:24,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:15:24,673 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:15:24,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:15:24,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:15:24,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:15:24,674 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:15:24,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:15:24,684 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-09-13 10:15:24,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:15:24,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-09-13 10:15:24,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:15:24,686 INFO L225 Difference]: With dead ends: 43 [2024-09-13 10:15:24,687 INFO L226 Difference]: Without dead ends: 43 [2024-09-13 10:15:24,687 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:15:24,688 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:15:24,689 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:15:24,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-13 10:15:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-13 10:15:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 34 states have internal predecessors, (37), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 10:15:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2024-09-13 10:15:24,694 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 12 [2024-09-13 10:15:24,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:15:24,695 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-09-13 10:15:24,695 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:15:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2024-09-13 10:15:24,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-13 10:15:24,695 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:15:24,695 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:15:24,696 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 10:15:24,696 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONPOST_CONDITION (and 12 more)] === [2024-09-13 10:15:24,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:15:24,698 INFO L85 PathProgramCache]: Analyzing trace with hash -901686274, now seen corresponding path program 1 times [2024-09-13 10:15:24,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:15:24,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483393553] [2024-09-13 10:15:24,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:15:24,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:15:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:24,728 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:15:24,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:15:24,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483393553] [2024-09-13 10:15:24,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483393553] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:15:24,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:15:24,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:15:24,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762558559] [2024-09-13 10:15:24,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:15:24,730 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:15:24,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:15:24,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:15:24,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:15:24,731 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:15:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:15:24,768 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-09-13 10:15:24,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:15:24,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-09-13 10:15:24,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:15:24,769 INFO L225 Difference]: With dead ends: 42 [2024-09-13 10:15:24,769 INFO L226 Difference]: Without dead ends: 42 [2024-09-13 10:15:24,770 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:15:24,770 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:15:24,771 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:15:24,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-13 10:15:24,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-13 10:15:24,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 10:15:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2024-09-13 10:15:24,781 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 12 [2024-09-13 10:15:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:15:24,781 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-09-13 10:15:24,782 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:15:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-09-13 10:15:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-13 10:15:24,782 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:15:24,782 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:15:24,782 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 10:15:24,783 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONPOST_CONDITION (and 12 more)] === [2024-09-13 10:15:24,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:15:24,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1062886337, now seen corresponding path program 1 times [2024-09-13 10:15:24,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:15:24,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019899399] [2024-09-13 10:15:24,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:15:24,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:15:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:15:24,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [462387828] [2024-09-13 10:15:24,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:15:24,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:15:24,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:15:24,809 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:15:24,810 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 10:15:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:24,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 10:15:24,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:15:24,917 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:15:24,917 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 10:15:24,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:15:24,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019899399] [2024-09-13 10:15:24,918 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:15:24,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462387828] [2024-09-13 10:15:24,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462387828] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:15:24,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:15:24,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:15:24,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751161071] [2024-09-13 10:15:24,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:15:24,920 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:15:24,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:15:24,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:15:24,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:15:24,922 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 10:15:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:15:24,972 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2024-09-13 10:15:24,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:15:24,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-13 10:15:24,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:15:24,974 INFO L225 Difference]: With dead ends: 59 [2024-09-13 10:15:24,974 INFO L226 Difference]: Without dead ends: 59 [2024-09-13 10:15:24,974 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:15:24,975 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:15:24,975 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 67 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:15:24,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-13 10:15:24,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2024-09-13 10:15:24,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 10:15:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2024-09-13 10:15:24,981 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 14 [2024-09-13 10:15:24,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:15:24,981 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2024-09-13 10:15:24,981 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 10:15:24,981 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2024-09-13 10:15:24,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-13 10:15:24,982 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:15:24,982 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:15:24,999 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 10:15:25,182 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-13 10:15:25,183 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONPOST_CONDITION (and 12 more)] === [2024-09-13 10:15:25,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:15:25,184 INFO L85 PathProgramCache]: Analyzing trace with hash -547588463, now seen corresponding path program 1 times [2024-09-13 10:15:25,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:15:25,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54192013] [2024-09-13 10:15:25,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:15:25,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:15:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:15:25,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [466267575] [2024-09-13 10:15:25,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:15:25,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:15:25,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:15:25,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:15:25,201 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 10:15:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:25,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-13 10:15:25,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:15:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 10:15:25,457 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 10:15:25,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:15:25,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54192013] [2024-09-13 10:15:25,458 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:15:25,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466267575] [2024-09-13 10:15:25,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466267575] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:15:25,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:15:25,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 10:15:25,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759968155] [2024-09-13 10:15:25,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:15:25,459 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 10:15:25,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:15:25,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 10:15:25,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-09-13 10:15:25,463 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:15:25,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:15:25,614 INFO L93 Difference]: Finished difference Result 68 states and 97 transitions. [2024-09-13 10:15:25,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 10:15:25,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-09-13 10:15:25,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:15:25,617 INFO L225 Difference]: With dead ends: 68 [2024-09-13 10:15:25,617 INFO L226 Difference]: Without dead ends: 65 [2024-09-13 10:15:25,617 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-09-13 10:15:25,619 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 81 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:15:25,619 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 41 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:15:25,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-09-13 10:15:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2024-09-13 10:15:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 10:15:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2024-09-13 10:15:25,629 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 20 [2024-09-13 10:15:25,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:15:25,630 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2024-09-13 10:15:25,630 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:15:25,630 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2024-09-13 10:15:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 10:15:25,630 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:15:25,631 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:15:25,648 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 10:15:25,836 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-13 10:15:25,837 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONPOST_CONDITION (and 12 more)] === [2024-09-13 10:15:25,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:15:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1481549316, now seen corresponding path program 1 times [2024-09-13 10:15:25,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:15:25,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476002505] [2024-09-13 10:15:25,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:15:25,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:15:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:15:25,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094777501] [2024-09-13 10:15:25,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:15:25,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:15:25,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:15:25,862 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:15:25,863 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 10:15:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:25,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-13 10:15:25,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:15:26,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 10:15:26,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:15:26,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:15:26,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476002505] [2024-09-13 10:15:26,558 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:15:26,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094777501] [2024-09-13 10:15:26,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094777501] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:15:26,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-13 10:15:26,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-09-13 10:15:26,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132707650] [2024-09-13 10:15:26,559 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-13 10:15:26,559 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 10:15:26,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:15:26,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 10:15:26,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-09-13 10:15:26,560 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:15:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:15:26,731 INFO L93 Difference]: Finished difference Result 85 states and 125 transitions. [2024-09-13 10:15:26,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 10:15:26,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-09-13 10:15:26,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:15:26,733 INFO L225 Difference]: With dead ends: 85 [2024-09-13 10:15:26,733 INFO L226 Difference]: Without dead ends: 82 [2024-09-13 10:15:26,734 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-09-13 10:15:26,734 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 37 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:15:26,734 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 92 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:15:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-09-13 10:15:26,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 69. [2024-09-13 10:15:26,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.22) internal successors, (61), 51 states have internal predecessors, (61), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 10:15:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2024-09-13 10:15:26,747 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 24 [2024-09-13 10:15:26,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:15:26,747 INFO L474 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2024-09-13 10:15:26,747 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:15:26,747 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2024-09-13 10:15:26,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-13 10:15:26,748 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:15:26,751 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, 1, 1, 1] [2024-09-13 10:15:26,768 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 10:15:26,955 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:15:26,956 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONPOST_CONDITION (and 12 more)] === [2024-09-13 10:15:26,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:15:26,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1924523002, now seen corresponding path program 1 times [2024-09-13 10:15:26,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:15:26,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570169641] [2024-09-13 10:15:26,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:15:26,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:15:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:27,006 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 10:15:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:27,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-13 10:15:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:27,012 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-13 10:15:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:27,015 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-13 10:15:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 10:15:27,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:15:27,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570169641] [2024-09-13 10:15:27,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570169641] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:15:27,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:15:27,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:15:27,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814549398] [2024-09-13 10:15:27,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:15:27,019 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:15:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:15:27,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:15:27,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:15:27,020 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 10:15:27,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:15:27,061 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-09-13 10:15:27,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:15:27,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-09-13 10:15:27,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:15:27,062 INFO L225 Difference]: With dead ends: 51 [2024-09-13 10:15:27,062 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 10:15:27,063 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:15:27,063 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 23 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:15:27,063 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 74 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:15:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 10:15:27,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-09-13 10:15:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 10:15:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-09-13 10:15:27,067 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 33 [2024-09-13 10:15:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:15:27,067 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-09-13 10:15:27,068 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 10:15:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-09-13 10:15:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-13 10:15:27,069 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:15:27,069 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-09-13 10:15:27,069 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-13 10:15:27,069 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONPOST_CONDITION (and 12 more)] === [2024-09-13 10:15:27,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:15:27,070 INFO L85 PathProgramCache]: Analyzing trace with hash -497196093, now seen corresponding path program 2 times [2024-09-13 10:15:27,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:15:27,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934824810] [2024-09-13 10:15:27,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:15:27,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:15:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:27,147 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 10:15:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:27,150 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-13 10:15:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:27,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-13 10:15:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:27,155 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-13 10:15:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:15:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 10:15:27,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:15:27,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934824810] [2024-09-13 10:15:27,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934824810] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:15:27,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:15:27,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 10:15:27,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768597729] [2024-09-13 10:15:27,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:15:27,159 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:15:27,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:15:27,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:15:27,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:15:27,160 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 10:15:27,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:15:27,208 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2024-09-13 10:15:27,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:15:27,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-09-13 10:15:27,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:15:27,208 INFO L225 Difference]: With dead ends: 22 [2024-09-13 10:15:27,208 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 10:15:27,208 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:15:27,209 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:15:27,209 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 46 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:15:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 10:15:27,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 10:15:27,210 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:15:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 10:15:27,210 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2024-09-13 10:15:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:15:27,210 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 10:15:27,210 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 10:15:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 10:15:27,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 10:15:27,213 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION (14 of 15 remaining) [2024-09-13 10:15:27,213 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION (13 of 15 remaining) [2024-09-13 10:15:27,214 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONPOST_CONDITION (12 of 15 remaining) [2024-09-13 10:15:27,214 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 15 remaining) [2024-09-13 10:15:27,214 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION (10 of 15 remaining) [2024-09-13 10:15:27,214 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (9 of 15 remaining) [2024-09-13 10:15:27,214 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 15 remaining) [2024-09-13 10:15:27,214 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION (7 of 15 remaining) [2024-09-13 10:15:27,215 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION (6 of 15 remaining) [2024-09-13 10:15:27,215 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION (5 of 15 remaining) [2024-09-13 10:15:27,215 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONPRE_CONDITION (4 of 15 remaining) [2024-09-13 10:15:27,215 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONPRE_CONDITION (3 of 15 remaining) [2024-09-13 10:15:27,215 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONPOST_CONDITION (2 of 15 remaining) [2024-09-13 10:15:27,215 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 15 remaining) [2024-09-13 10:15:27,215 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 15 remaining) [2024-09-13 10:15:27,216 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-13 10:15:27,218 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:15:27,220 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 10:15:27,222 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-13 10:15:27,222 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-13 10:15:27,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 10:15:27 BoogieIcfgContainer [2024-09-13 10:15:27,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 10:15:27,223 INFO L158 Benchmark]: Toolchain (without parser) took 4709.81ms. Allocated memory was 178.3MB in the beginning and 237.0MB in the end (delta: 58.7MB). Free memory was 119.3MB in the beginning and 201.3MB in the end (delta: -82.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:15:27,223 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 178.3MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:15:27,223 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 178.3MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:15:27,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.71ms. Allocated memory is still 178.3MB. Free memory was 118.9MB in the beginning and 105.0MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 10:15:27,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.45ms. Allocated memory is still 178.3MB. Free memory was 105.0MB in the beginning and 103.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 10:15:27,224 INFO L158 Benchmark]: Boogie Preprocessor took 42.67ms. Allocated memory is still 178.3MB. Free memory was 103.4MB in the beginning and 101.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:15:27,224 INFO L158 Benchmark]: RCFGBuilder took 382.32ms. Allocated memory is still 178.3MB. Free memory was 101.3MB in the beginning and 86.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 10:15:27,225 INFO L158 Benchmark]: TraceAbstraction took 3906.03ms. Allocated memory was 178.3MB in the beginning and 237.0MB in the end (delta: 58.7MB). Free memory was 85.3MB in the beginning and 201.3MB in the end (delta: -116.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:15:27,226 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.18ms. Allocated memory is still 178.3MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.89ms. Allocated memory is still 178.3MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.71ms. Allocated memory is still 178.3MB. Free memory was 118.9MB in the beginning and 105.0MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.45ms. Allocated memory is still 178.3MB. Free memory was 105.0MB in the beginning and 103.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.67ms. Allocated memory is still 178.3MB. Free memory was 103.4MB in the beginning and 101.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 382.32ms. Allocated memory is still 178.3MB. Free memory was 101.3MB in the beginning and 86.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3906.03ms. Allocated memory was 178.3MB in the beginning and 237.0MB in the end (delta: 58.7MB). Free memory was 85.3MB in the beginning and 201.3MB in the end (delta: -116.0MB). There was no memory consumed. 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: 23]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 11]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 11]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 37]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 46]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 23]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 17]: 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: 14]: 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, 45 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 841 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 423 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 418 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=9, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 40 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 559 SizeOfPredicates, 1 NumberOfNonLiveVariables, 304 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 68/69 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 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 10:15:27,253 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...