./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound5.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/hard-ll_valuebound5.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1d5fa637 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound5.c ../results/automizer-verification-files/SV-COMP24_unreach-call/hard-ll_valuebound5.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-dev-1d5fa63-m [2024-09-13 10:18:59,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 10:18:59,715 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 10:18:59,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 10:18:59,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 10:18:59,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 10:18:59,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 10:18:59,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 10:18:59,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 10:18:59,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 10:18:59,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 10:18:59,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 10:18:59,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 10:18:59,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 10:18:59,746 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 10:18:59,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 10:18:59,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 10:18:59,747 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 10:18:59,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 10:18:59,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 10:18:59,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 10:18:59,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 10:18:59,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 10:18:59,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 10:18:59,750 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 10:18:59,750 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 10:18:59,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 10:18:59,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 10:18:59,751 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 10:18:59,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 10:18:59,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 10:18:59,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 10:18:59,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:18:59,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 10:18:59,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 10:18:59,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 10:18:59,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 10:18:59,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 10:18:59,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 10:18:59,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 10:18:59,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 10:18:59,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 10:18:59,762 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:18:59,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 10:18:59,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 10:18:59,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 10:18:59,992 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 10:18:59,992 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 10:18:59,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/hard-ll_valuebound5.yml/witness-2.1.yml [2024-09-13 10:19:00,075 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 10:19:00,075 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 10:19:00,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound5.c [2024-09-13 10:19:01,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 10:19:01,605 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 10:19:01,606 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound5.c [2024-09-13 10:19:01,613 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/50bacac68/ac937f8383d647ad94a78522605f16de/FLAG1f9cfff61 [2024-09-13 10:19:01,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/50bacac68/ac937f8383d647ad94a78522605f16de [2024-09-13 10:19:01,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 10:19:01,626 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 10:19:01,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 10:19:01,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 10:19:01,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 10:19:01,634 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:19:00" (1/2) ... [2024-09-13 10:19:01,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b81453a and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:01, skipping insertion in model container [2024-09-13 10:19:01,635 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:19:00" (1/2) ... [2024-09-13 10:19:01,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@51fa488e and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:01, skipping insertion in model container [2024-09-13 10:19:01,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:19:01" (2/2) ... [2024-09-13 10:19:01,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b81453a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:19:01, skipping insertion in model container [2024-09-13 10:19:01,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:19:01" (2/2) ... [2024-09-13 10:19:01,643 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 10:19:01,643 INFO L1541 ArrayList]: Loop invariant at [L36-L44] (((((((((((0 <= (r + (((__int128) -1 * d) / 2))) && (((A % 4294967296) + d) == (((long long) (B % 4294967296) * 4) + r))) && (1 <= (B % 4294967296))) && ((d % 2) == 0)) && ((A % 4294967296) <= 5)) && (q == 0)) && (p == 4)) && (((A % 4294967296) + (d / 2)) == (r + ((long long) 2 * (B % 4294967296))))) || (((((((((A % 4294967296) == r) && ((((r + ((A / 4294967296) * 4294967296)) + ((__int128) d * 3)) + (25769803776 * (B / 4294967296))) <= (A + ((long long) B * 6)))) && (p == 2)) && (1 <= (B % 4294967296))) && ((d % 2) == 0)) && (q == 0)) && ((B % 4294967296) <= r)) && ((((long long) B * 8) + r) <= ((((__int128) d * 4) + 5) + ((B / 4294967296) * 34359738368))))) || ((((((((A % 4294967296) == r) && ((B % 4294967296) <= 5)) && ((d + ((B / 4294967296) * 4294967296)) == B)) && ((A % 4294967296) <= 5)) && (q == 0)) && (1 <= d)) && (p == 1))) || (((((((p == 8) && (((A % 4294967296) + d) == (((long long) 8 * (B % 4294967296)) + r))) && (1 <= (B % 4294967296))) && (((long long) 8 * (B % 4294967296)) == d)) && (q == 0)) && ((((long long) B * 8) + r) <= ((5 + d) + ((B / 4294967296) * 34359738368)))) && (((long long) (B % 4294967296) * 4) <= r))) [2024-09-13 10:19:01,644 INFO L1541 ArrayList]: Loop invariant at [L46-L58] (((((((((((((((((((A % 4294967296) + d) == (((long long) 6 * (B % 4294967296)) + r)) && (p == 2)) && (((long long) (B % 4294967296) * 4) <= (A % 4294967296))) && (1 <= (B % 4294967296))) && (d <= 2)) && (q == 4)) && ((((long long) 7 * B) + r) <= (((__int128) d + 6) + (30064771072 * (B / 4294967296))))) && (A <= (((r + ((A / 4294967296) * 4294967296)) + ((__int128) d * 2)) + 1))) || ((((((0 <= r) && (((__int128) r + 1) <= d)) && ((d + r) == (A % 4294967296))) && ((r + ((long long) 2 * (B % 4294967296))) == ((A % 4294967296) + d))) && (q == 1)) && (p == 1))) || ((((((((0 <= r) && (((A % 4294967296) + d) == (((long long) 8 * (B % 4294967296)) + r))) && (((A % 4294967296) + (d / 2)) == (((long long) 6 * (B % 4294967296)) + r))) && ((d % 2) == 0)) && (p == 4)) && ((d + r) <= (5 + ((__int128) 4294967296 * ((-1 + d) / 2147483648))))) && (q == 4)) && ((((long long) 7 * B) + r) <= (((__int128) d + 6) + (30064771072 * (B / 4294967296)))))) || (((((((0 <= (r + (((__int128) -1 * d) / 2))) && (((__int128) r + 1) <= d)) && (((A % 4294967296) + d) == (((long long) (B % 4294967296) * 4) + r))) && ((d % 2) == 0)) && (q == 0)) && (p == 4)) && (((A % 4294967296) + (d / 2)) == (r + ((long long) 2 * (B % 4294967296)))))) || ((((((q == 2) && (0 <= r)) && (p == 2)) && (((A % 4294967296) + d) == (((long long) (B % 4294967296) * 4) + r))) && ((A % 4294967296) == (r + ((long long) 2 * (B % 4294967296))))) && (((d + r) + 1) <= ((long long) (B % 4294967296) * 4)))) || (((((((A % 4294967296) == r) && (d == ((long long) 2 * (B % 4294967296)))) && (((__int128) r + 1) <= d)) && (p == 2)) && (q == 0)) && ((B % 4294967296) <= r))) || ((((((q == 2) && ((B % 4294967296) <= 2147483647)) && (((__int128) r + 1) <= (d + (d / 2)))) && (d == (((A % 4294967296) + ((__int128) -1 * r)) / 2))) && ((A % 4294967296) == (r + ((long long) 2 * (B % 4294967296))))) && (p == 1))) || ((((((((r + (B % 4294967296)) + ((__int128) q * (B % 4294967296))) == ((A % 4294967296) + d)) && (((__int128) r + 1) <= (d + (d / 2)))) && ((r + ((long long) 2 * (B % 4294967296))) <= 4294967295)) && ((r + ((__int128) q * (B % 4294967296))) == (A % 4294967296))) && ((d + ((long long) 2 * (B % 4294967296))) <= 4294967295)) && (p == 1))) || (((((A % 4294967296) == r) && ((d + ((B / 4294967296) * 4294967296)) == B)) && (q == 0)) && (p == 1))) || (((((((p == 8) && (((A % 4294967296) + d) == (((long long) 8 * (B % 4294967296)) + r))) && (1 <= (B % 4294967296))) && (((long long) 8 * (B % 4294967296)) == d)) && ((A % 4294967296) <= 5)) && (q == 0)) && (((long long) (B % 4294967296) * 4) <= r))) [2024-09-13 10:19:01,644 INFO L1541 ArrayList]: Function contract at [L11]: requires null, ensures (\old(cond) != 0) [2024-09-13 10:19:01,644 INFO L1541 ArrayList]: Function contract at [L14]: requires (\old(cond) != 0), ensures (\old(cond) != 0) [2024-09-13 10:19:01,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 10:19:01,824 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/hard-ll_valuebound5.c[538,551] [2024-09-13 10:19:01,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:19:01,857 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 10:19:01,896 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/hard-ll_valuebound5.c[538,551] Start Parsing Local Start Parsing Local [2024-09-13 10:19:01,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:19:01,987 INFO L204 MainTranslator]: Completed translation [2024-09-13 10:19:01,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:19:01 WrapperNode [2024-09-13 10:19:01,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 10:19:01,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 10:19:01,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 10:19:01,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 10:19:01,996 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:19:01" (1/1) ... [2024-09-13 10:19:02,010 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:19:01" (1/1) ... [2024-09-13 10:19:02,076 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-09-13 10:19:02,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 10:19:02,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 10:19:02,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 10:19:02,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 10:19:02,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:19:01" (1/1) ... [2024-09-13 10:19:02,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:19:01" (1/1) ... [2024-09-13 10:19:02,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:19:01" (1/1) ... [2024-09-13 10:19:02,105 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure assume_abort_if_not is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-13 10:19:02,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:19:01" (1/1) ... [2024-09-13 10:19:02,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:19:01" (1/1) ... [2024-09-13 10:19:02,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:19:01" (1/1) ... [2024-09-13 10:19:02,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:19:01" (1/1) ... [2024-09-13 10:19:02,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:19:01" (1/1) ... [2024-09-13 10:19:02,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:19:01" (1/1) ... [2024-09-13 10:19:02,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 10:19:02,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 10:19:02,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 10:19:02,151 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 10:19:02,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:19:01" (1/1) ... [2024-09-13 10:19:02,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:19:02,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:02,184 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:19:02,186 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:19:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 10:19:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 10:19:02,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 10:19:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 10:19:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 10:19:02,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 10:19:02,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 10:19:02,232 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 10:19:02,292 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 10:19:02,294 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 10:19:02,805 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 10:19:02,834 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-09-13 10:19:02,834 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 10:19:02,857 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 10:19:02,857 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 10:19:02,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:19:02 BoogieIcfgContainer [2024-09-13 10:19:02,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 10:19:02,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 10:19:02,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 10:19:02,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 10:19:02,863 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:19:00" (1/4) ... [2024-09-13 10:19:02,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5221390d and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 10:19:02, skipping insertion in model container [2024-09-13 10:19:02,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 10:19:01" (2/4) ... [2024-09-13 10:19:02,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5221390d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:19:02, skipping insertion in model container [2024-09-13 10:19:02,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:19:01" (3/4) ... [2024-09-13 10:19:02,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5221390d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:19:02, skipping insertion in model container [2024-09-13 10:19:02,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:19:02" (4/4) ... [2024-09-13 10:19:02,866 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound5.c [2024-09-13 10:19:02,887 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 10:19:02,888 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-09-13 10:19:02,938 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 10:19:02,948 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;@985b8ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 10:19:02,949 INFO L337 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-09-13 10:19:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 10:19:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 10:19:02,960 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:02,960 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 10:19:02,961 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:02,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash 134843102, now seen corresponding path program 1 times [2024-09-13 10:19:02,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:02,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771122153] [2024-09-13 10:19:02,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:02,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:03,151 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:19:03,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:03,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771122153] [2024-09-13 10:19:03,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771122153] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:19:03,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:19:03,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:19:03,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455568088] [2024-09-13 10:19:03,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:19:03,156 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 10:19:03,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:03,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 10:19:03,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 10:19:03,178 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:19:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:03,198 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-09-13 10:19:03,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 10:19:03,200 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-13 10:19:03,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:03,206 INFO L225 Difference]: With dead ends: 43 [2024-09-13 10:19:03,206 INFO L226 Difference]: Without dead ends: 41 [2024-09-13 10:19:03,208 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 10:19:03,211 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:03,213 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:19:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-13 10:19:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-13 10:19:03,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 29 states have internal predecessors, (32), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 10:19:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2024-09-13 10:19:03,249 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 5 [2024-09-13 10:19:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:03,249 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2024-09-13 10:19:03,250 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:19:03,250 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2024-09-13 10:19:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 10:19:03,251 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:03,251 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 10:19:03,252 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 10:19:03,252 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:03,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:03,255 INFO L85 PathProgramCache]: Analyzing trace with hash 134843164, now seen corresponding path program 1 times [2024-09-13 10:19:03,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:03,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226805636] [2024-09-13 10:19:03,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:03,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:03,349 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:19:03,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:03,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226805636] [2024-09-13 10:19:03,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226805636] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:19:03,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:19:03,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:19:03,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976781468] [2024-09-13 10:19:03,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:19:03,351 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:19:03,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:03,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:19:03,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:19:03,352 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:19:03,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:03,400 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-09-13 10:19:03,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:19:03,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-13 10:19:03,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:03,401 INFO L225 Difference]: With dead ends: 40 [2024-09-13 10:19:03,402 INFO L226 Difference]: Without dead ends: 40 [2024-09-13 10:19:03,402 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:19:03,403 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:03,403 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:19:03,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-13 10:19:03,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-09-13 10:19:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 10:19:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2024-09-13 10:19:03,415 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 5 [2024-09-13 10:19:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:03,416 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-09-13 10:19:03,416 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:19:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-09-13 10:19:03,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 10:19:03,417 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:03,417 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:03,418 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 10:19:03,418 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:03,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:03,419 INFO L85 PathProgramCache]: Analyzing trace with hash 363565673, now seen corresponding path program 1 times [2024-09-13 10:19:03,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:03,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84672429] [2024-09-13 10:19:03,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:03,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:04,059 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:04,105 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:04,135 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 10:19:04,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:04,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84672429] [2024-09-13 10:19:04,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84672429] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:19:04,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:19:04,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 10:19:04,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657074726] [2024-09-13 10:19:04,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:19:04,165 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 10:19:04,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:04,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 10:19:04,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-13 10:19:04,166 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 10:19:04,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:04,400 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2024-09-13 10:19:04,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 10:19:04,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2024-09-13 10:19:04,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:04,402 INFO L225 Difference]: With dead ends: 51 [2024-09-13 10:19:04,403 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 10:19:04,403 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-13 10:19:04,405 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 52 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:04,406 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 113 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:19:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 10:19:04,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-13 10:19:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 34 states have internal predecessors, (38), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 10:19:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-09-13 10:19:04,421 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 19 [2024-09-13 10:19:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:04,422 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-09-13 10:19:04,422 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 10:19:04,423 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-09-13 10:19:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 10:19:04,424 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:04,424 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:04,424 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 10:19:04,425 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:04,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:04,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1764960997, now seen corresponding path program 1 times [2024-09-13 10:19:04,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:04,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184643858] [2024-09-13 10:19:04,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:04,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:04,473 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:04,481 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:04,483 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 10:19:04,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:04,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184643858] [2024-09-13 10:19:04,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184643858] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:19:04,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:19:04,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:19:04,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724155795] [2024-09-13 10:19:04,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:19:04,495 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:19:04,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:04,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:19:04,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:19:04,496 INFO L87 Difference]: Start difference. First operand 51 states and 67 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:19:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:04,505 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2024-09-13 10:19:04,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:19:04,507 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 10:19:04,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:04,508 INFO L225 Difference]: With dead ends: 49 [2024-09-13 10:19:04,508 INFO L226 Difference]: Without dead ends: 49 [2024-09-13 10:19:04,509 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:19:04,510 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:19:04,510 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:19:04,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-13 10:19:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-13 10:19:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 10:19:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-09-13 10:19:04,519 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 24 [2024-09-13 10:19:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:04,520 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-09-13 10:19:04,520 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:19:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-09-13 10:19:04,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 10:19:04,521 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:04,521 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:04,521 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 10:19:04,522 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:04,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:04,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1764960836, now seen corresponding path program 1 times [2024-09-13 10:19:04,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:04,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004385456] [2024-09-13 10:19:04,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:04,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:04,554 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:04,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:04,560 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 10:19:04,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:04,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004385456] [2024-09-13 10:19:04,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004385456] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:19:04,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:19:04,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:19:04,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450108713] [2024-09-13 10:19:04,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:19:04,564 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:19:04,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:04,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:19:04,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:19:04,565 INFO L87 Difference]: Start difference. First operand 49 states and 65 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:19:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:04,601 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2024-09-13 10:19:04,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:19:04,601 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 10:19:04,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:04,602 INFO L225 Difference]: With dead ends: 48 [2024-09-13 10:19:04,602 INFO L226 Difference]: Without dead ends: 48 [2024-09-13 10:19:04,603 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:19:04,604 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:04,604 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:19:04,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-13 10:19:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-09-13 10:19:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 10:19:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2024-09-13 10:19:04,612 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 24 [2024-09-13 10:19:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:04,613 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2024-09-13 10:19:04,613 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:19:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2024-09-13 10:19:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 10:19:04,617 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:04,617 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:04,618 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 10:19:04,618 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:04,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:04,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1154352905, now seen corresponding path program 1 times [2024-09-13 10:19:04,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:04,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458862302] [2024-09-13 10:19:04,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:04,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,206 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,210 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,212 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:19:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,224 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:19:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:19:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 10:19:05,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:05,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458862302] [2024-09-13 10:19:05,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458862302] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:19:05,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677604605] [2024-09-13 10:19:05,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:05,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:05,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:05,263 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:19:05,265 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:19:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-13 10:19:05,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 10:19:05,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:19:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 10:19:06,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677604605] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:19:06,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:19:06,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-13 10:19:06,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500751575] [2024-09-13 10:19:06,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:19:06,351 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 10:19:06,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:06,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 10:19:06,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-09-13 10:19:06,352 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-09-13 10:19:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:06,741 INFO L93 Difference]: Finished difference Result 73 states and 106 transitions. [2024-09-13 10:19:06,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 10:19:06,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 37 [2024-09-13 10:19:06,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:06,742 INFO L225 Difference]: With dead ends: 73 [2024-09-13 10:19:06,743 INFO L226 Difference]: Without dead ends: 73 [2024-09-13 10:19:06,743 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-09-13 10:19:06,743 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:06,744 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 140 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:19:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-13 10:19:06,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2024-09-13 10:19:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-13 10:19:06,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2024-09-13 10:19:06,752 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 37 [2024-09-13 10:19:06,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:06,752 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2024-09-13 10:19:06,753 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-09-13 10:19:06,753 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2024-09-13 10:19:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-13 10:19:06,754 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:06,754 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:06,771 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:19:06,958 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-13 10:19:06,960 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:06,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:06,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1515868503, now seen corresponding path program 1 times [2024-09-13 10:19:06,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:06,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751286315] [2024-09-13 10:19:06,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:06,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:19:07,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1286669106] [2024-09-13 10:19:07,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:07,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:07,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:07,014 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:19:07,016 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:19:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:07,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 10:19:07,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-13 10:19:07,149 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 10:19:07,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751286315] [2024-09-13 10:19:07,150 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:19:07,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286669106] [2024-09-13 10:19:07,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286669106] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:19:07,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:19:07,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:19:07,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169189868] [2024-09-13 10:19:07,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:19:07,152 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:19:07,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:07,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:19:07,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:19:07,153 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-13 10:19:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:07,205 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2024-09-13 10:19:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:19:07,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2024-09-13 10:19:07,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:07,208 INFO L225 Difference]: With dead ends: 68 [2024-09-13 10:19:07,209 INFO L226 Difference]: Without dead ends: 68 [2024-09-13 10:19:07,209 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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:19:07,210 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:07,211 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 62 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:19:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-13 10:19:07,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2024-09-13 10:19:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 41 states have internal predecessors, (50), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-13 10:19:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2024-09-13 10:19:07,222 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 94 transitions. Word has length 50 [2024-09-13 10:19:07,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:07,223 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 94 transitions. [2024-09-13 10:19:07,223 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-13 10:19:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 94 transitions. [2024-09-13 10:19:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-13 10:19:07,226 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:07,226 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:07,245 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-13 10:19:07,427 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:19:07,427 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:07,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:07,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2018739730, now seen corresponding path program 1 times [2024-09-13 10:19:07,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:07,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528849945] [2024-09-13 10:19:07,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:07,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:07,504 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:07,506 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:07,508 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:07,510 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:19:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:07,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:19:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:07,516 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:19:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:07,520 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:19:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:07,525 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:19:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:07,528 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 10:19:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-13 10:19:07,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:07,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528849945] [2024-09-13 10:19:07,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528849945] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:19:07,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:19:07,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:19:07,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765994971] [2024-09-13 10:19:07,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:19:07,533 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:19:07,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:07,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:19:07,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:19:07,534 INFO L87 Difference]: Start difference. First operand 65 states and 94 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-13 10:19:07,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:07,577 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. [2024-09-13 10:19:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:19:07,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2024-09-13 10:19:07,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:07,580 INFO L225 Difference]: With dead ends: 72 [2024-09-13 10:19:07,580 INFO L226 Difference]: Without dead ends: 65 [2024-09-13 10:19:07,580 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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:19:07,581 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:07,581 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:19:07,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-09-13 10:19:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-09-13 10:19:07,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-13 10:19:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-09-13 10:19:07,589 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 55 [2024-09-13 10:19:07,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:07,592 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-09-13 10:19:07,592 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-13 10:19:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-09-13 10:19:07,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-13 10:19:07,593 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:07,593 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:07,593 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 10:19:07,593 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:07,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:07,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1118640133, now seen corresponding path program 2 times [2024-09-13 10:19:07,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:07,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108368424] [2024-09-13 10:19:07,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:07,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:08,567 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:08,570 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:08,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:08,574 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:19:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:08,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:19:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:08,594 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:19:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:08,614 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:19:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:08,623 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:19:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:08,633 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 10:19:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-13 10:19:08,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:08,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108368424] [2024-09-13 10:19:08,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108368424] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:19:08,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104795655] [2024-09-13 10:19:08,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 10:19:08,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:08,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:08,647 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:19:08,648 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:19:08,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 10:19:08,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 10:19:08,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-13 10:19:08,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-13 10:19:09,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:19:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-13 10:19:10,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104795655] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:19:10,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:19:10,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-09-13 10:19:10,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719733199] [2024-09-13 10:19:10,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:19:10,074 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-13 10:19:10,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:10,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-13 10:19:10,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-09-13 10:19:10,076 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 7 states have call predecessors, (21), 7 states have call successors, (21) [2024-09-13 10:19:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:10,827 INFO L93 Difference]: Finished difference Result 104 states and 159 transitions. [2024-09-13 10:19:10,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-13 10:19:10,828 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 7 states have call predecessors, (21), 7 states have call successors, (21) Word has length 55 [2024-09-13 10:19:10,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:10,829 INFO L225 Difference]: With dead ends: 104 [2024-09-13 10:19:10,829 INFO L226 Difference]: Without dead ends: 104 [2024-09-13 10:19:10,829 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-09-13 10:19:10,830 INFO L434 NwaCegarLoop]: 69 mSDtfsCounter, 37 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:10,830 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 344 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-13 10:19:10,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-09-13 10:19:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2024-09-13 10:19:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.26) internal successors, (63), 52 states have internal predecessors, (63), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-09-13 10:19:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2024-09-13 10:19:10,841 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 55 [2024-09-13 10:19:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:10,842 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2024-09-13 10:19:10,842 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 7 states have call predecessors, (21), 7 states have call successors, (21) [2024-09-13 10:19:10,842 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2024-09-13 10:19:10,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-13 10:19:10,843 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:10,843 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:10,859 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:19:11,044 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-13 10:19:11,044 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:11,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:11,045 INFO L85 PathProgramCache]: Analyzing trace with hash -550970448, now seen corresponding path program 1 times [2024-09-13 10:19:11,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:11,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101053665] [2024-09-13 10:19:11,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:11,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:12,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:12,136 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:12,140 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:12,142 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:19:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:12,149 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:19:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:12,155 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:19:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:12,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:19:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:12,178 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:19:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:12,201 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 10:19:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:12,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 10:19:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:12,242 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 10:19:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-13 10:19:12,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:12,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101053665] [2024-09-13 10:19:12,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101053665] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:19:12,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895072523] [2024-09-13 10:19:12,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:12,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:12,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:12,269 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:19:12,271 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:19:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:12,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-13 10:19:12,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-13 10:19:13,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:19:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-13 10:19:14,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895072523] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:19:14,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:19:14,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-09-13 10:19:14,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481221554] [2024-09-13 10:19:14,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:19:14,439 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-13 10:19:14,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:14,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-13 10:19:14,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2024-09-13 10:19:14,441 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand has 17 states, 16 states have (on average 2.4375) internal successors, (39), 17 states have internal predecessors, (39), 9 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2024-09-13 10:19:14,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:14,855 INFO L93 Difference]: Finished difference Result 97 states and 143 transitions. [2024-09-13 10:19:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 10:19:14,856 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 17 states have internal predecessors, (39), 9 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) Word has length 69 [2024-09-13 10:19:14,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:14,857 INFO L225 Difference]: With dead ends: 97 [2024-09-13 10:19:14,857 INFO L226 Difference]: Without dead ends: 97 [2024-09-13 10:19:14,857 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2024-09-13 10:19:14,858 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 4 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:14,858 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 226 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:19:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-13 10:19:14,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2024-09-13 10:19:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 58 states have internal predecessors, (69), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-09-13 10:19:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2024-09-13 10:19:14,875 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 69 [2024-09-13 10:19:14,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:14,876 INFO L474 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2024-09-13 10:19:14,876 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 17 states have internal predecessors, (39), 9 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2024-09-13 10:19:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2024-09-13 10:19:14,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-13 10:19:14,877 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:14,877 INFO L216 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:14,895 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-13 10:19:15,078 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:15,078 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:15,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:15,079 INFO L85 PathProgramCache]: Analyzing trace with hash -493891693, now seen corresponding path program 3 times [2024-09-13 10:19:15,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:15,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708895310] [2024-09-13 10:19:15,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:15,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,599 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,601 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:19:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,605 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:19:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,611 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:19:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:19:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,623 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:19:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 10:19:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 10:19:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 10:19:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,654 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-13 10:19:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-09-13 10:19:15,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:15,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708895310] [2024-09-13 10:19:15,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708895310] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:19:15,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446557099] [2024-09-13 10:19:15,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 10:19:15,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:15,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:15,667 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:19:15,669 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 10:19:15,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-13 10:19:15,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 10:19:15,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-13 10:19:15,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-09-13 10:19:16,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:19:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-09-13 10:19:18,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446557099] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 10:19:18,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 10:19:18,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 8] total 17 [2024-09-13 10:19:18,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643445301] [2024-09-13 10:19:18,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:19:18,102 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 10:19:18,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:18,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 10:19:18,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-09-13 10:19:18,103 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-13 10:19:18,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:18,831 INFO L93 Difference]: Finished difference Result 114 states and 178 transitions. [2024-09-13 10:19:18,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 10:19:18,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2024-09-13 10:19:18,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:18,833 INFO L225 Difference]: With dead ends: 114 [2024-09-13 10:19:18,833 INFO L226 Difference]: Without dead ends: 114 [2024-09-13 10:19:18,833 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-09-13 10:19:18,834 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 19 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:18,834 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 149 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-13 10:19:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-09-13 10:19:18,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2024-09-13 10:19:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-09-13 10:19:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2024-09-13 10:19:18,841 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 73 [2024-09-13 10:19:18,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:18,842 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2024-09-13 10:19:18,842 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-13 10:19:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2024-09-13 10:19:18,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-13 10:19:18,843 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:18,843 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:18,858 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-13 10:19:19,047 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-13 10:19:19,048 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:19,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1381978582, now seen corresponding path program 1 times [2024-09-13 10:19:19,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:19,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239834152] [2024-09-13 10:19:19,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:19,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:19:19,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1098089206] [2024-09-13 10:19:19,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:19,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:19,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:19,171 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:19:19,173 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-13 10:19:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:19,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-13 10:19:19,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-09-13 10:19:19,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:19:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-09-13 10:19:19,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:19,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239834152] [2024-09-13 10:19:19,541 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:19:19,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098089206] [2024-09-13 10:19:19,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098089206] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:19:19,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 10:19:19,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-09-13 10:19:19,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881324494] [2024-09-13 10:19:19,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 10:19:19,542 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 10:19:19,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:19,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 10:19:19,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:19:19,543 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-09-13 10:19:19,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:19,685 INFO L93 Difference]: Finished difference Result 106 states and 157 transitions. [2024-09-13 10:19:19,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 10:19:19,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 82 [2024-09-13 10:19:19,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:19,686 INFO L225 Difference]: With dead ends: 106 [2024-09-13 10:19:19,686 INFO L226 Difference]: Without dead ends: 106 [2024-09-13 10:19:19,687 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:19:19,687 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:19,687 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 107 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:19:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-13 10:19:19,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2024-09-13 10:19:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-09-13 10:19:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 133 transitions. [2024-09-13 10:19:19,699 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 133 transitions. Word has length 82 [2024-09-13 10:19:19,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:19,699 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 133 transitions. [2024-09-13 10:19:19,699 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-09-13 10:19:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 133 transitions. [2024-09-13 10:19:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-13 10:19:19,702 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:19,702 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:19,721 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-13 10:19:19,903 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-13 10:19:19,903 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:19,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:19,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1551961905, now seen corresponding path program 1 times [2024-09-13 10:19:19,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:19,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310666758] [2024-09-13 10:19:19,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:19,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:20,391 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:20,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:20,395 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:20,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:19:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:20,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:19:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:20,403 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:19:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:20,406 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:19:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:20,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:19:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:20,423 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 10:19:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:20,431 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 10:19:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:20,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 10:19:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:20,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-13 10:19:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:20,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-13 10:19:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:20,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 10:19:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:20,458 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 10:19:20,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:20,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310666758] [2024-09-13 10:19:20,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310666758] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:19:20,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045445944] [2024-09-13 10:19:20,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:20,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:20,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:20,461 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:19:20,462 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-13 10:19:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:20,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-13 10:19:20,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 10:19:20,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:19:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 10:19:21,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045445944] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:19:21,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:19:21,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-09-13 10:19:21,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410682489] [2024-09-13 10:19:21,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:19:21,070 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-13 10:19:21,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:21,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-13 10:19:21,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-09-13 10:19:21,071 INFO L87 Difference]: Start difference. First operand 90 states and 133 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 10 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) [2024-09-13 10:19:21,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:21,283 INFO L93 Difference]: Finished difference Result 97 states and 142 transitions. [2024-09-13 10:19:21,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 10:19:21,283 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 10 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) Word has length 87 [2024-09-13 10:19:21,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:21,284 INFO L225 Difference]: With dead ends: 97 [2024-09-13 10:19:21,284 INFO L226 Difference]: Without dead ends: 84 [2024-09-13 10:19:21,285 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-09-13 10:19:21,285 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:21,285 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 142 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:19:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-13 10:19:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-09-13 10:19:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-09-13 10:19:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2024-09-13 10:19:21,291 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 87 [2024-09-13 10:19:21,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:21,291 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2024-09-13 10:19:21,291 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 10 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) [2024-09-13 10:19:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2024-09-13 10:19:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-13 10:19:21,295 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:21,295 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:21,314 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-13 10:19:21,499 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:21,500 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:21,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:21,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1137425730, now seen corresponding path program 2 times [2024-09-13 10:19:21,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:21,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604525555] [2024-09-13 10:19:21,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:21,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:22,784 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:22,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:22,789 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:22,791 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:19:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:22,797 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:19:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:22,802 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:19:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:22,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:19:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:22,813 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:19:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:22,818 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 10:19:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:22,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 10:19:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:22,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 10:19:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:22,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-13 10:19:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:22,846 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 10:19:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:22,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 10:19:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 10:19:22,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604525555] [2024-09-13 10:19:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604525555] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:19:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413911853] [2024-09-13 10:19:22,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 10:19:22,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:22,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:22,867 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:19:22,868 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-13 10:19:22,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 10:19:22,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 10:19:22,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-13 10:19:22,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 10:19:23,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:19:25,529 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 10:19:25,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413911853] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:19:25,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:19:25,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-09-13 10:19:25,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868874024] [2024-09-13 10:19:25,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:19:25,530 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-13 10:19:25,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:25,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-13 10:19:25,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2024-09-13 10:19:25,531 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 23 states have internal predecessors, (52), 13 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 13 states have call predecessors, (36), 13 states have call successors, (36) [2024-09-13 10:19:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:26,804 INFO L93 Difference]: Finished difference Result 102 states and 160 transitions. [2024-09-13 10:19:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-13 10:19:26,805 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 23 states have internal predecessors, (52), 13 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 13 states have call predecessors, (36), 13 states have call successors, (36) Word has length 87 [2024-09-13 10:19:26,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:26,806 INFO L225 Difference]: With dead ends: 102 [2024-09-13 10:19:26,806 INFO L226 Difference]: Without dead ends: 102 [2024-09-13 10:19:26,806 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-09-13 10:19:26,806 INFO L434 NwaCegarLoop]: 63 mSDtfsCounter, 31 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:26,807 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 371 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-13 10:19:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-09-13 10:19:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2024-09-13 10:19:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 51 states have internal predecessors, (66), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-09-13 10:19:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 128 transitions. [2024-09-13 10:19:26,811 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 128 transitions. Word has length 87 [2024-09-13 10:19:26,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:26,811 INFO L474 AbstractCegarLoop]: Abstraction has 85 states and 128 transitions. [2024-09-13 10:19:26,811 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 23 states have internal predecessors, (52), 13 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 13 states have call predecessors, (36), 13 states have call successors, (36) [2024-09-13 10:19:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 128 transitions. [2024-09-13 10:19:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-09-13 10:19:26,812 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:26,812 INFO L216 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:26,830 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-13 10:19:27,012 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:27,013 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:27,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:27,013 INFO L85 PathProgramCache]: Analyzing trace with hash -296419461, now seen corresponding path program 1 times [2024-09-13 10:19:27,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:27,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849808100] [2024-09-13 10:19:27,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:27,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,624 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,628 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,629 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:19:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,633 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:19:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,638 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:19:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:19:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,648 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:19:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 10:19:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,659 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 10:19:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,671 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 10:19:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-13 10:19:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,687 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 10:19:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 10:19:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,702 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-09-13 10:19:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-13 10:19:27,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:27,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849808100] [2024-09-13 10:19:27,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849808100] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:19:27,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59380677] [2024-09-13 10:19:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:27,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:27,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:27,714 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:19:27,717 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-13 10:19:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:27,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-13 10:19:27,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-13 10:19:28,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:19:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-13 10:19:29,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59380677] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:19:29,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:19:29,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-09-13 10:19:29,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479224102] [2024-09-13 10:19:29,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:19:29,272 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-13 10:19:29,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:29,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-13 10:19:29,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-09-13 10:19:29,274 INFO L87 Difference]: Start difference. First operand 85 states and 128 transitions. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 12 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-09-13 10:19:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:29,751 INFO L93 Difference]: Finished difference Result 87 states and 129 transitions. [2024-09-13 10:19:29,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-13 10:19:29,751 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 12 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 91 [2024-09-13 10:19:29,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:29,752 INFO L225 Difference]: With dead ends: 87 [2024-09-13 10:19:29,752 INFO L226 Difference]: Without dead ends: 87 [2024-09-13 10:19:29,752 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 200 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-09-13 10:19:29,753 INFO L434 NwaCegarLoop]: 61 mSDtfsCounter, 21 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:29,753 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 342 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:19:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-13 10:19:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2024-09-13 10:19:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 states have internal predecessors, (54), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-09-13 10:19:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 106 transitions. [2024-09-13 10:19:29,757 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 106 transitions. Word has length 91 [2024-09-13 10:19:29,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:29,757 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 106 transitions. [2024-09-13 10:19:29,758 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 12 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-09-13 10:19:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2024-09-13 10:19:29,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-09-13 10:19:29,759 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:29,759 INFO L216 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:29,772 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-13 10:19:29,962 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-13 10:19:29,963 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:29,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:29,963 INFO L85 PathProgramCache]: Analyzing trace with hash -436202417, now seen corresponding path program 3 times [2024-09-13 10:19:29,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:29,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496976795] [2024-09-13 10:19:29,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:29,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:19:30,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1337999708] [2024-09-13 10:19:30,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 10:19:30,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:30,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:30,142 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:19:30,147 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-13 10:19:30,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-13 10:19:30,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 10:19:30,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-13 10:19:30,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-09-13 10:19:31,026 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:19:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-09-13 10:19:34,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:34,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496976795] [2024-09-13 10:19:34,118 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:19:34,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337999708] [2024-09-13 10:19:34,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337999708] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:19:34,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 10:19:34,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2024-09-13 10:19:34,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557701973] [2024-09-13 10:19:34,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 10:19:34,119 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-13 10:19:34,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:34,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-13 10:19:34,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-09-13 10:19:34,120 INFO L87 Difference]: Start difference. First operand 74 states and 106 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 8 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2024-09-13 10:19:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:36,589 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2024-09-13 10:19:36,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-13 10:19:36,590 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 8 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) Word has length 101 [2024-09-13 10:19:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:36,591 INFO L225 Difference]: With dead ends: 93 [2024-09-13 10:19:36,591 INFO L226 Difference]: Without dead ends: 93 [2024-09-13 10:19:36,592 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2024-09-13 10:19:36,592 INFO L434 NwaCegarLoop]: 56 mSDtfsCounter, 26 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:36,592 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 250 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-13 10:19:36,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-13 10:19:36,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2024-09-13 10:19:36,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.163265306122449) internal successors, (57), 48 states have internal predecessors, (57), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-09-13 10:19:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2024-09-13 10:19:36,596 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 101 [2024-09-13 10:19:36,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:36,596 INFO L474 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2024-09-13 10:19:36,597 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 8 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2024-09-13 10:19:36,597 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2024-09-13 10:19:36,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-09-13 10:19:36,598 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:36,598 INFO L216 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:36,608 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-13 10:19:36,802 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-13 10:19:36,803 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:36,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:36,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1495614028, now seen corresponding path program 4 times [2024-09-13 10:19:36,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:36,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259628507] [2024-09-13 10:19:36,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:36,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,749 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,751 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,754 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:19:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,762 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:19:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,773 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:19:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,784 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:19:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,789 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:19:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,796 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 10:19:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,801 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 10:19:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,806 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 10:19:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,813 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-13 10:19:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 10:19:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,827 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 10:19:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,834 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-09-13 10:19:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,843 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-13 10:19:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,850 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-09-13 10:19:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-09-13 10:19:38,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:38,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259628507] [2024-09-13 10:19:38,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259628507] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:19:38,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82630730] [2024-09-13 10:19:38,859 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-13 10:19:38,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:38,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:38,861 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:19:38,862 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-13 10:19:38,946 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-13 10:19:38,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 10:19:38,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-13 10:19:38,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-09-13 10:19:39,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:19:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-09-13 10:19:41,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82630730] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:19:41,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:19:41,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2024-09-13 10:19:41,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645192316] [2024-09-13 10:19:41,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:19:41,821 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 10:19:41,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:41,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 10:19:41,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-09-13 10:19:41,822 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 21 states, 20 states have (on average 2.65) internal successors, (53), 21 states have internal predecessors, (53), 13 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2024-09-13 10:19:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:42,620 INFO L93 Difference]: Finished difference Result 92 states and 132 transitions. [2024-09-13 10:19:42,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-13 10:19:42,620 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 21 states have internal predecessors, (53), 13 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) Word has length 105 [2024-09-13 10:19:42,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:42,621 INFO L225 Difference]: With dead ends: 92 [2024-09-13 10:19:42,621 INFO L226 Difference]: Without dead ends: 92 [2024-09-13 10:19:42,621 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 229 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2024-09-13 10:19:42,622 INFO L434 NwaCegarLoop]: 63 mSDtfsCounter, 22 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:42,622 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 418 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-13 10:19:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-13 10:19:42,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2024-09-13 10:19:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-09-13 10:19:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-09-13 10:19:42,625 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 105 [2024-09-13 10:19:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:42,626 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-09-13 10:19:42,626 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 21 states have internal predecessors, (53), 13 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2024-09-13 10:19:42,626 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-09-13 10:19:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-09-13 10:19:42,632 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:42,632 INFO L216 NwaCegarLoop]: trace histogram [16, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:42,648 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-09-13 10:19:42,833 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-13 10:19:42,833 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:42,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:42,833 INFO L85 PathProgramCache]: Analyzing trace with hash -36897264, now seen corresponding path program 2 times [2024-09-13 10:19:42,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:42,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190576914] [2024-09-13 10:19:42,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:42,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,433 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,435 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,436 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,437 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:19:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:19:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,441 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:19:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:19:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:19:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 10:19:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,457 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 10:19:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 10:19:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-13 10:19:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,464 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 10:19:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 10:19:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,469 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-09-13 10:19:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,471 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-13 10:19:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,473 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-09-13 10:19:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,480 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-09-13 10:19:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,483 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-09-13 10:19:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-09-13 10:19:43,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:43,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190576914] [2024-09-13 10:19:43,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190576914] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:19:43,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925926684] [2024-09-13 10:19:43,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 10:19:43,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:43,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:43,488 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:19:43,489 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-13 10:19:43,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 10:19:43,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 10:19:43,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-09-13 10:19:43,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-09-13 10:19:44,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:19:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2024-09-13 10:19:44,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925926684] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 10:19:44,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 10:19:44,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 11] total 18 [2024-09-13 10:19:44,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352241064] [2024-09-13 10:19:44,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:19:44,661 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:19:44,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:44,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:19:44,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-09-13 10:19:44,662 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-13 10:19:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:44,703 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2024-09-13 10:19:44,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:19:44,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 119 [2024-09-13 10:19:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:44,704 INFO L225 Difference]: With dead ends: 83 [2024-09-13 10:19:44,704 INFO L226 Difference]: Without dead ends: 64 [2024-09-13 10:19:44,705 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-09-13 10:19:44,705 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:44,705 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 66 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:19:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-13 10:19:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-09-13 10:19:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-13 10:19:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2024-09-13 10:19:44,709 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 119 [2024-09-13 10:19:44,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:44,709 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2024-09-13 10:19:44,710 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-13 10:19:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2024-09-13 10:19:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-09-13 10:19:44,711 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:44,711 INFO L216 NwaCegarLoop]: trace histogram [16, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:44,728 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-09-13 10:19:44,911 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-09-13 10:19:44,911 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:44,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2055486565, now seen corresponding path program 1 times [2024-09-13 10:19:44,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:44,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338220707] [2024-09-13 10:19:44,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,280 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,282 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,283 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:19:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:19:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,291 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:19:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,295 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:19:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,299 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:19:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 10:19:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,310 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 10:19:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 10:19:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,321 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-13 10:19:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,325 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 10:19:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,330 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 10:19:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,337 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-09-13 10:19:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,344 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-13 10:19:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,352 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-09-13 10:19:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,359 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-09-13 10:19:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,375 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-09-13 10:19:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-09-13 10:19:47,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:47,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338220707] [2024-09-13 10:19:47,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338220707] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:19:47,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248093182] [2024-09-13 10:19:47,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:47,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:47,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:47,393 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:19:47,394 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-09-13 10:19:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:47,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-09-13 10:19:47,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-09-13 10:19:48,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:19:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 9 proven. 35 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-09-13 10:19:56,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248093182] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:19:56,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:19:56,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2024-09-13 10:19:56,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123227355] [2024-09-13 10:19:56,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:19:56,499 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-13 10:19:56,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:56,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-13 10:19:56,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2024-09-13 10:19:56,500 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 28 states have internal predecessors, (70), 17 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 17 states have call predecessors, (51), 17 states have call successors, (51) [2024-09-13 10:19:57,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:57,249 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2024-09-13 10:19:57,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-13 10:19:57,249 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 28 states have internal predecessors, (70), 17 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 17 states have call predecessors, (51), 17 states have call successors, (51) Word has length 119 [2024-09-13 10:19:57,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:57,250 INFO L225 Difference]: With dead ends: 70 [2024-09-13 10:19:57,250 INFO L226 Difference]: Without dead ends: 70 [2024-09-13 10:19:57,251 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 257 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2024-09-13 10:19:57,251 INFO L434 NwaCegarLoop]: 56 mSDtfsCounter, 21 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:57,251 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 266 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-13 10:19:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-13 10:19:57,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2024-09-13 10:19:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-13 10:19:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2024-09-13 10:19:57,254 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 119 [2024-09-13 10:19:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:57,255 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2024-09-13 10:19:57,255 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 28 states have internal predecessors, (70), 17 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 17 states have call predecessors, (51), 17 states have call successors, (51) [2024-09-13 10:19:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2024-09-13 10:19:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-09-13 10:19:57,256 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:57,257 INFO L216 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:57,271 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-09-13 10:19:57,457 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:57,457 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:57,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1366143380, now seen corresponding path program 2 times [2024-09-13 10:19:57,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:57,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783526072] [2024-09-13 10:19:57,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:57,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:19:57,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1080370482] [2024-09-13 10:19:57,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 10:19:57,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:57,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:57,570 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:19:57,572 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-09-13 10:19:57,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 10:19:57,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 10:19:57,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-09-13 10:19:57,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-09-13 10:19:58,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:20:00,840 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2024-09-13 10:20:00,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:20:00,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783526072] [2024-09-13 10:20:00,840 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:20:00,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080370482] [2024-09-13 10:20:00,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080370482] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:20:00,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 10:20:00,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 17 [2024-09-13 10:20:00,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776819263] [2024-09-13 10:20:00,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 10:20:00,841 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-13 10:20:00,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:20:00,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-13 10:20:00,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-09-13 10:20:00,842 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 9 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2024-09-13 10:20:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:20:01,234 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2024-09-13 10:20:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-13 10:20:01,235 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 9 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) Word has length 133 [2024-09-13 10:20:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:20:01,235 INFO L225 Difference]: With dead ends: 66 [2024-09-13 10:20:01,235 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 10:20:01,235 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2024-09-13 10:20:01,236 INFO L434 NwaCegarLoop]: 66 mSDtfsCounter, 15 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:20:01,236 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 291 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:20:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 10:20:01,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 10:20:01,236 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:20:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 10:20:01,237 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2024-09-13 10:20:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:20:01,237 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 10:20:01,237 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 18 states have internal predecessors, (52), 9 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2024-09-13 10:20:01,237 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 10:20:01,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 10:20:01,240 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 12 remaining) [2024-09-13 10:20:01,240 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (10 of 12 remaining) [2024-09-13 10:20:01,241 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (9 of 12 remaining) [2024-09-13 10:20:01,241 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (8 of 12 remaining) [2024-09-13 10:20:01,241 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 12 remaining) [2024-09-13 10:20:01,241 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (6 of 12 remaining) [2024-09-13 10:20:01,241 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION (5 of 12 remaining) [2024-09-13 10:20:01,241 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION (4 of 12 remaining) [2024-09-13 10:20:01,241 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION (3 of 12 remaining) [2024-09-13 10:20:01,242 INFO L785 garLoopResultBuilder]: Registering result SAFE for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 12 remaining) [2024-09-13 10:20:01,242 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2024-09-13 10:20:01,242 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 12 remaining) [2024-09-13 10:20:01,256 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-09-13 10:20:01,445 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:20:01,448 INFO L408 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:20:01,449 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 10:20:01,452 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-13 10:20:01,452 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-13 10:20:01,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 10:20:01 BoogieIcfgContainer [2024-09-13 10:20:01,453 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 10:20:01,454 INFO L158 Benchmark]: Toolchain (without parser) took 59828.49ms. Allocated memory was 144.7MB in the beginning and 612.4MB in the end (delta: 467.7MB). Free memory was 75.6MB in the beginning and 557.7MB in the end (delta: -482.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:20:01,454 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 75.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:20:01,455 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:20:01,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.53ms. Allocated memory is still 144.7MB. Free memory was 75.4MB in the beginning and 111.3MB in the end (delta: -35.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-13 10:20:01,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.12ms. Allocated memory is still 144.7MB. Free memory was 111.3MB in the beginning and 105.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-13 10:20:01,455 INFO L158 Benchmark]: Boogie Preprocessor took 72.06ms. Allocated memory is still 144.7MB. Free memory was 105.1MB in the beginning and 101.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 10:20:01,459 INFO L158 Benchmark]: RCFGBuilder took 707.62ms. Allocated memory is still 144.7MB. Free memory was 101.6MB in the beginning and 53.4MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-09-13 10:20:01,459 INFO L158 Benchmark]: TraceAbstraction took 58593.63ms. Allocated memory was 144.7MB in the beginning and 612.4MB in the end (delta: 467.7MB). Free memory was 52.6MB in the beginning and 557.7MB in the end (delta: -505.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:20:01,460 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.17ms. Allocated memory is still 113.2MB. Free memory is still 75.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.53ms. Allocated memory is still 144.7MB. Free memory was 75.4MB in the beginning and 111.3MB in the end (delta: -35.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.12ms. Allocated memory is still 144.7MB. Free memory was 111.3MB in the beginning and 105.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.06ms. Allocated memory is still 144.7MB. Free memory was 105.1MB in the beginning and 101.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 707.62ms. Allocated memory is still 144.7MB. Free memory was 101.6MB in the beginning and 53.4MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 58593.63ms. Allocated memory was 144.7MB in the beginning and 612.4MB in the end (delta: 467.7MB). Free memory was 52.6MB in the beginning and 557.7MB in the end (delta: -505.1MB). 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: 36]: 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: 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: 11]: 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 3 procedures, 43 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 58.5s, OverallIterations: 20, TraceHistogramMax: 18, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 369 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 294 mSDsluCounter, 3680 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2730 mSDsCounter, 393 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3510 IncrementalHoareTripleChecker+Invalid, 3903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 393 mSolverCounterUnsat, 950 mSDtfsCounter, 3510 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2783 GetRequests, 2516 SyntacticMatches, 31 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=11, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 132 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 43.6s InterpolantComputationTime, 2548 NumberOfCodeBlocks, 2477 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 3297 ConstructedInterpolants, 0 QuantifiedInterpolants, 57750 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2666 ConjunctsInSsa, 343 ConjunctsInUnsatCore, 43 InterpolantComputations, 9 PerfectInterpolantSequences, 10043/10710 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 10:20:01,648 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE