./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound10.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/hard-ll_valuebound10.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 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_valuebound10.c ../results/automizer-verification-files/SV-COMP24_unreach-call/hard-ll_valuebound10.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-5189fb6-m [2024-09-13 05:47:34,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 05:47:34,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 05:47:34,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 05:47:34,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 05:47:34,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 05:47:34,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 05:47:34,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 05:47:34,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 05:47:34,157 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 05:47:34,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 05:47:34,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 05:47:34,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 05:47:34,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 05:47:34,158 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 05:47:34,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 05:47:34,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 05:47:34,159 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 05:47:34,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 05:47:34,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 05:47:34,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 05:47:34,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 05:47:34,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 05:47:34,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 05:47:34,166 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 05:47:34,166 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 05:47:34,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 05:47:34,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 05:47:34,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 05:47:34,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 05:47:34,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 05:47:34,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 05:47:34,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:47:34,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 05:47:34,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 05:47:34,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 05:47:34,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 05:47:34,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 05:47:34,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 05:47:34,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 05:47:34,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 05:47:34,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 05:47:34,172 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 05:47:34,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 05:47:34,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 05:47:34,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 05:47:34,467 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 05:47:34,468 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 05:47:34,469 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_valuebound10.yml/witness-2.1.yml [2024-09-13 05:47:34,529 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 05:47:34,529 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 05:47:34,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound10.c [2024-09-13 05:47:35,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 05:47:36,008 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 05:47:36,008 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound10.c [2024-09-13 05:47:36,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/8f06f0921/9302b8805bd64b25a0fd83fe1414e8a9/FLAG33a6be138 [2024-09-13 05:47:36,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/8f06f0921/9302b8805bd64b25a0fd83fe1414e8a9 [2024-09-13 05:47:36,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 05:47:36,026 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 05:47:36,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 05:47:36,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 05:47:36,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 05:47:36,032 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 05:47:34" (1/2) ... [2024-09-13 05:47:36,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6abee337 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:47:36, skipping insertion in model container [2024-09-13 05:47:36,034 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 05:47:34" (1/2) ... [2024-09-13 05:47:36,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@778a3142 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:47:36, skipping insertion in model container [2024-09-13 05:47:36,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:47:36" (2/2) ... [2024-09-13 05:47:36,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6abee337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:47:36, skipping insertion in model container [2024-09-13 05:47:36,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:47:36" (2/2) ... [2024-09-13 05:47:36,042 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 05:47:36,043 INFO L1541 ArrayList]: Loop invariant at [L36-L44] ((((((((((((d < ((__int128) r + 1)) && (d == ((__int128) p * (B % 4294967296)))) && (1 <= (B % 4294967296))) && ((((__int128) (B % 4294967296) * (p / 2)) + ((__int128) (p / 4) * (B % 4294967296))) == ((d / 4) + (d / 2)))) && ((d % 2) == 0)) && (q == 0)) && (((A % 4294967296) + (((__int128) (B % 4294967296) * (p / 2)) / 2)) == (r + ((__int128) (p / 4) * (B % 4294967296))))) && (4 <= p)) || ((((((A % 4294967296) == r) && ((d + ((B / 4294967296) * 4294967296)) == B)) && (q == 0)) && (1 <= d)) && (p == 1))) || (((((((A % 4294967296) == r) && (d == ((long long) 2 * (B % 4294967296)))) && (p == 2)) && (1 <= (B % 4294967296))) && (q == 0)) && ((B % 4294967296) <= r))) || (((((((((0 <= (r + (((__int128) -1 * d) / 2))) && (d == ((__int128) p * (B % 4294967296)))) && ((((__int128) (p / 8) * (B % 4294967296)) + ((__int128) (p / 4) * (B % 4294967296))) == ((((((__int128) (B % 4294967296) * (p / 2)) + r) + ((long long) -1 * (A % 4294967296))) / 4) + (((((__int128) (B % 4294967296) * (p / 2)) + r) + ((long long) -1 * (A % 4294967296))) / 2)))) && (1 <= (B % 4294967296))) && (((A % 4294967296) + (d / 2)) == (((__int128) (B % 4294967296) * (p / 2)) + r))) && ((d % 2) == 0)) && (q == 0)) && (((A % 4294967296) + (((__int128) (B % 4294967296) * (p / 2)) / 2)) == (r + ((__int128) (p / 4) * (B % 4294967296))))) && (4 <= p))) || ((((((0 <= (r + (((__int128) -1 * d) / 2))) && (((A % 4294967296) + d) == (((long long) (B % 4294967296) * 4) + r))) && (1 <= (B % 4294967296))) && (q == 0)) && (p == 4)) && (((A % 4294967296) + (d / 2)) == (r + ((long long) 2 * (B % 4294967296)))))) [2024-09-13 05:47:36,043 INFO L1541 ArrayList]: Loop invariant at [L46-L58] (((((((((((((0 <= (r + (((__int128) -1 * d) / 2))) && (((__int128) r + 1) <= d)) && (((A % 4294967296) + d) == (((long long) (B % 4294967296) * 4) + r))) && (q == 0)) && (p == 4)) && (((A % 4294967296) + (d / 2)) == (r + ((long long) 2 * (B % 4294967296))))) || ((((((0 <= r) && (((__int128) r + 1) <= d)) && ((d + r) == (A % 4294967296))) && ((r + ((long long) 2 * (B % 4294967296))) == ((A % 4294967296) + d))) && (q == 1)) && (p == 1))) || ((((((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))) || ((((((((0 <= (r + (((__int128) -1 * d) / 2))) && (d == ((__int128) p * (B % 4294967296)))) && (((__int128) r + 1) <= d)) && ((((__int128) (p / 8) * (B % 4294967296)) + ((__int128) (p / 4) * (B % 4294967296))) == ((((((__int128) (B % 4294967296) * (p / 2)) + r) + ((long long) -1 * (A % 4294967296))) / 4) + (((((__int128) (B % 4294967296) * (p / 2)) + r) + ((long long) -1 * (A % 4294967296))) / 2)))) && (((A % 4294967296) + (d / 2)) == (((__int128) (B % 4294967296) * (p / 2)) + r))) && ((d % 2) == 0)) && (q == 0)) && (((A % 4294967296) + (((__int128) (B % 4294967296) * (p / 2)) / 2)) == (r + ((__int128) (p / 4) * (B % 4294967296)))))) || ((((((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))) || (((((A % 4294967296) == r) && ((d + ((B / 4294967296) * 4294967296)) == B)) && (q == 0)) && (p == 1))) || ((((((((__int128) r + 1) <= (d + (d / 2))) && (q == 3)) && (((A % 4294967296) + d) == (((long long) (B % 4294967296) * 4) + r))) && ((d + ((long long) 2 * (B % 4294967296))) <= 4294967295)) && ((r + ((long long) 3 * (B % 4294967296))) == (A % 4294967296))) && (p == 1))) [2024-09-13 05:47:36,043 INFO L1541 ArrayList]: Function contract at [L11]: requires null, ensures (\old(cond) != 0) [2024-09-13 05:47:36,044 INFO L1541 ArrayList]: Function contract at [L14]: requires (\old(cond) != 0), ensures (\old(cond) != 0) [2024-09-13 05:47:36,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 05:47:36,211 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_valuebound10.c[538,551] [2024-09-13 05:47:36,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:47:36,246 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 05:47:36,283 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_valuebound10.c[538,551] Start Parsing Local Start Parsing Local [2024-09-13 05:47:36,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:47:36,366 INFO L204 MainTranslator]: Completed translation [2024-09-13 05:47:36,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:47:36 WrapperNode [2024-09-13 05:47:36,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 05:47:36,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 05:47:36,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 05:47:36,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 05:47:36,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:47:36" (1/1) ... [2024-09-13 05:47:36,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:47:36" (1/1) ... [2024-09-13 05:47:36,454 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-09-13 05:47:36,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 05:47:36,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 05:47:36,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 05:47:36,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 05:47:36,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:47:36" (1/1) ... [2024-09-13 05:47:36,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:47:36" (1/1) ... [2024-09-13 05:47:36,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:47:36" (1/1) ... [2024-09-13 05:47:36,485 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 05:47:36,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:47:36" (1/1) ... [2024-09-13 05:47:36,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:47:36" (1/1) ... [2024-09-13 05:47:36,520 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:47:36" (1/1) ... [2024-09-13 05:47:36,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:47:36" (1/1) ... [2024-09-13 05:47:36,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:47:36" (1/1) ... [2024-09-13 05:47:36,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:47:36" (1/1) ... [2024-09-13 05:47:36,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 05:47:36,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 05:47:36,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 05:47:36,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 05:47:36,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:47:36" (1/1) ... [2024-09-13 05:47:36,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:47:36,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:47:36,594 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 05:47:36,599 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 05:47:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 05:47:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 05:47:36,642 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 05:47:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 05:47:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 05:47:36,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 05:47:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 05:47:36,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 05:47:36,737 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 05:47:36,740 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 05:47:37,336 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 05:47:37,388 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-09-13 05:47:37,388 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 05:47:37,433 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 05:47:37,433 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 05:47:37,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:47:37 BoogieIcfgContainer [2024-09-13 05:47:37,435 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 05:47:37,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 05:47:37,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 05:47:37,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 05:47:37,441 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 05:47:34" (1/4) ... [2024-09-13 05:47:37,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb16b66 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 05:47:37, skipping insertion in model container [2024-09-13 05:47:37,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 05:47:36" (2/4) ... [2024-09-13 05:47:37,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb16b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:47:37, skipping insertion in model container [2024-09-13 05:47:37,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:47:36" (3/4) ... [2024-09-13 05:47:37,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb16b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:47:37, skipping insertion in model container [2024-09-13 05:47:37,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:47:37" (4/4) ... [2024-09-13 05:47:37,443 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound10.c [2024-09-13 05:47:37,461 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 05:47:37,462 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-09-13 05:47:37,507 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 05:47:37,515 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;@4066a108, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 05:47:37,517 INFO L337 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-09-13 05:47:37,520 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 05:47:37,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 05:47:37,527 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:47:37,528 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 05:47:37,528 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 05:47:37,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:47:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash 134843102, now seen corresponding path program 1 times [2024-09-13 05:47:37,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:47:37,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454417546] [2024-09-13 05:47:37,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:47:37,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:47:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:37,676 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 05:47:37,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:47:37,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454417546] [2024-09-13 05:47:37,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454417546] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:47:37,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:47:37,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:47:37,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724251352] [2024-09-13 05:47:37,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:47:37,684 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 05:47:37,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:47:37,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 05:47:37,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 05:47:37,716 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 05:47:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:47:37,745 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-09-13 05:47:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 05:47:37,747 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 05:47:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:47:37,754 INFO L225 Difference]: With dead ends: 43 [2024-09-13 05:47:37,754 INFO L226 Difference]: Without dead ends: 41 [2024-09-13 05:47:37,757 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 05:47:37,760 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 05:47:37,761 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 05:47:37,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-13 05:47:37,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-13 05:47:37,799 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 05:47:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2024-09-13 05:47:37,802 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 5 [2024-09-13 05:47:37,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:47:37,802 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2024-09-13 05:47:37,802 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 05:47:37,803 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2024-09-13 05:47:37,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 05:47:37,804 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:47:37,804 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 05:47:37,804 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 05:47:37,805 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 05:47:37,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:47:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash 134843164, now seen corresponding path program 1 times [2024-09-13 05:47:37,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:47:37,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896730186] [2024-09-13 05:47:37,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:47:37,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:47:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:37,909 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 05:47:37,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:47:37,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896730186] [2024-09-13 05:47:37,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896730186] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:47:37,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:47:37,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:47:37,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171652037] [2024-09-13 05:47:37,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:47:37,911 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:47:37,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:47:37,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:47:37,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:47:37,915 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 05:47:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:47:37,958 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-09-13 05:47:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:47:37,958 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 05:47:37,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:47:37,960 INFO L225 Difference]: With dead ends: 40 [2024-09-13 05:47:37,961 INFO L226 Difference]: Without dead ends: 40 [2024-09-13 05:47:37,961 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 05:47:37,962 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 05:47:37,964 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 05:47:37,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-13 05:47:37,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-09-13 05:47:37,972 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 05:47:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2024-09-13 05:47:37,974 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 5 [2024-09-13 05:47:37,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:47:37,975 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-09-13 05:47:37,975 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 05:47:37,975 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-09-13 05:47:37,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 05:47:37,976 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:47:37,976 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:47:37,977 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 05:47:37,977 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 05:47:37,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:47:37,982 INFO L85 PathProgramCache]: Analyzing trace with hash 363565673, now seen corresponding path program 1 times [2024-09-13 05:47:37,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:47:37,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063741139] [2024-09-13 05:47:37,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:47:37,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:47:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:38,559 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:47:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:38,564 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:47:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:38,569 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:47:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-13 05:47:38,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:47:38,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063741139] [2024-09-13 05:47:38,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063741139] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:47:38,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:47:38,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 05:47:38,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462517855] [2024-09-13 05:47:38,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:47:38,607 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 05:47:38,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:47:38,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 05:47:38,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-13 05:47:38,609 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 05:47:38,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:47:38,825 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2024-09-13 05:47:38,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 05:47:38,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 19 [2024-09-13 05:47:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:47:38,827 INFO L225 Difference]: With dead ends: 51 [2024-09-13 05:47:38,828 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 05:47:38,828 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-13 05:47:38,829 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:47:38,831 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 119 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 05:47:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 05:47:38,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-13 05:47:38,840 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 05:47:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-09-13 05:47:38,843 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 19 [2024-09-13 05:47:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:47:38,844 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-09-13 05:47:38,844 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 05:47:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-09-13 05:47:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 05:47:38,846 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:47:38,846 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 05:47:38,846 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 05:47:38,846 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 05:47:38,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:47:38,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1764960997, now seen corresponding path program 1 times [2024-09-13 05:47:38,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:47:38,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578193178] [2024-09-13 05:47:38,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:47:38,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:47:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:38,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:47:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:38,913 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:47:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:38,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:47:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:38,921 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 05:47:38,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:47:38,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578193178] [2024-09-13 05:47:38,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578193178] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:47:38,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:47:38,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:47:38,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656956177] [2024-09-13 05:47:38,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:47:38,922 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:47:38,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:47:38,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:47:38,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:47:38,923 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 05:47:38,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:47:38,933 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2024-09-13 05:47:38,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:47:38,937 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 05:47:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:47:38,938 INFO L225 Difference]: With dead ends: 49 [2024-09-13 05:47:38,938 INFO L226 Difference]: Without dead ends: 49 [2024-09-13 05:47:38,940 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 05:47:38,941 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 05:47:38,942 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 05:47:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-13 05:47:38,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-13 05:47:38,947 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 05:47:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-09-13 05:47:38,950 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 24 [2024-09-13 05:47:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:47:38,951 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-09-13 05:47:38,951 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 05:47:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-09-13 05:47:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 05:47:38,952 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:47:38,952 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 05:47:38,952 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 05:47:38,952 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 05:47:38,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:47:38,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1764960836, now seen corresponding path program 1 times [2024-09-13 05:47:38,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:47:38,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724672441] [2024-09-13 05:47:38,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:47:38,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:47:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:39,003 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:47:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:39,006 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:47:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:39,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:47:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:39,014 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 05:47:39,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:47:39,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724672441] [2024-09-13 05:47:39,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724672441] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:47:39,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:47:39,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:47:39,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240619196] [2024-09-13 05:47:39,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:47:39,019 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:47:39,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:47:39,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:47:39,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:47:39,019 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 05:47:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:47:39,064 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2024-09-13 05:47:39,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:47:39,065 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 05:47:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:47:39,066 INFO L225 Difference]: With dead ends: 48 [2024-09-13 05:47:39,066 INFO L226 Difference]: Without dead ends: 48 [2024-09-13 05:47:39,066 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 05:47:39,071 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 05:47:39,071 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 05:47:39,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-13 05:47:39,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-09-13 05:47:39,079 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 05:47:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2024-09-13 05:47:39,080 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 24 [2024-09-13 05:47:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:47:39,081 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2024-09-13 05:47:39,081 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 05:47:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2024-09-13 05:47:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 05:47:39,082 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:47:39,082 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 05:47:39,082 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 05:47:39,083 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 05:47:39,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:47:39,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1154352905, now seen corresponding path program 1 times [2024-09-13 05:47:39,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:47:39,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815097631] [2024-09-13 05:47:39,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:47:39,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:47:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:39,613 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:47:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:39,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:47:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:39,618 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:47:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:39,620 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:47:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:39,630 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:47:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:39,641 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:47:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:39,651 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 05:47:39,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:47:39,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815097631] [2024-09-13 05:47:39,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815097631] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:47:39,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834980415] [2024-09-13 05:47:39,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:47:39,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:47:39,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:47:39,655 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 05:47:39,657 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 05:47:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:39,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-13 05:47:39,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:47:40,021 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 05:47:40,022 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:47:50,287 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 05:47:50,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834980415] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:47:50,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:47:50,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-09-13 05:47:50,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223000698] [2024-09-13 05:47:50,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:47:50,289 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 05:47:50,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:47:50,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 05:47:50,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-13 05:47:50,290 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-13 05:47:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:47:51,045 INFO L93 Difference]: Finished difference Result 73 states and 106 transitions. [2024-09-13 05:47:51,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 05:47:51,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 37 [2024-09-13 05:47:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:47:51,048 INFO L225 Difference]: With dead ends: 73 [2024-09-13 05:47:51,048 INFO L226 Difference]: Without dead ends: 73 [2024-09-13 05:47:51,048 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-09-13 05:47:51,050 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-13 05:47:51,051 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 116 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-13 05:47:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-13 05:47:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2024-09-13 05:47:51,064 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 05:47:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2024-09-13 05:47:51,065 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 37 [2024-09-13 05:47:51,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:47:51,065 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2024-09-13 05:47:51,069 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-13 05:47:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2024-09-13 05:47:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-13 05:47:51,070 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:47:51,071 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 05:47:51,090 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 05:47:51,271 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 05:47:51,272 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 05:47:51,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:47:51,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1515868503, now seen corresponding path program 1 times [2024-09-13 05:47:51,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:47:51,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539799011] [2024-09-13 05:47:51,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:47:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:47:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:47:51,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316999495] [2024-09-13 05:47:51,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:47:51,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:47:51,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:47:51,375 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 05:47:51,378 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 05:47:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:51,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 05:47:51,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:47:51,507 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 05:47:51,509 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 05:47:51,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:47:51,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539799011] [2024-09-13 05:47:51,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:47:51,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316999495] [2024-09-13 05:47:51,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316999495] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:47:51,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:47:51,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:47:51,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173956563] [2024-09-13 05:47:51,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:47:51,511 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:47:51,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:47:51,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:47:51,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:47:51,512 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 05:47:51,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:47:51,599 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2024-09-13 05:47:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:47:51,600 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 05:47:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:47:51,601 INFO L225 Difference]: With dead ends: 68 [2024-09-13 05:47:51,602 INFO L226 Difference]: Without dead ends: 68 [2024-09-13 05:47:51,603 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 05:47:51,603 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:47:51,604 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.1s Time] [2024-09-13 05:47:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-13 05:47:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2024-09-13 05:47:51,613 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 05:47:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2024-09-13 05:47:51,615 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 94 transitions. Word has length 50 [2024-09-13 05:47:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:47:51,615 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 94 transitions. [2024-09-13 05:47:51,616 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 05:47:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 94 transitions. [2024-09-13 05:47:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-13 05:47:51,617 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:47:51,617 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 05:47:51,630 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 05:47:51,818 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 05:47:51,818 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 05:47:51,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:47:51,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2018739730, now seen corresponding path program 1 times [2024-09-13 05:47:51,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:47:51,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805920558] [2024-09-13 05:47:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:47:51,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:47:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:51,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:47:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:51,989 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:47:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:51,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:47:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:51,994 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:47:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:52,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:47:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:52,010 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:47:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:52,014 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 05:47:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:52,020 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 05:47:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:52,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 05:47:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:52,032 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 05:47:52,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:47:52,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805920558] [2024-09-13 05:47:52,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805920558] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:47:52,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:47:52,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:47:52,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753718076] [2024-09-13 05:47:52,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:47:52,034 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:47:52,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:47:52,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:47:52,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:47:52,036 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 05:47:52,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:47:52,112 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. [2024-09-13 05:47:52,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:47:52,113 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 05:47:52,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:47:52,115 INFO L225 Difference]: With dead ends: 72 [2024-09-13 05:47:52,115 INFO L226 Difference]: Without dead ends: 65 [2024-09-13 05:47:52,115 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 05:47:52,116 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:47:52,117 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.1s Time] [2024-09-13 05:47:52,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-09-13 05:47:52,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-09-13 05:47:52,122 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 05:47:52,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-09-13 05:47:52,123 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 55 [2024-09-13 05:47:52,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:47:52,123 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-09-13 05:47:52,123 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 05:47:52,124 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-09-13 05:47:52,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-13 05:47:52,125 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:47:52,125 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 05:47:52,125 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 05:47:52,125 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 05:47:52,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:47:52,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1118640133, now seen corresponding path program 2 times [2024-09-13 05:47:52,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:47:52,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893196352] [2024-09-13 05:47:52,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:47:52,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:47:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:52,939 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:47:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:52,943 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:47:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:52,945 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:47:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:52,947 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:47:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:52,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:47:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:52,964 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:47:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:52,974 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 05:47:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:52,982 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 05:47:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:52,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 05:47:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:47:53,015 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 05:47:53,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:47:53,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893196352] [2024-09-13 05:47:53,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893196352] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:47:53,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389591691] [2024-09-13 05:47:53,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 05:47:53,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:47:53,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:47:53,020 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 05:47:53,038 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 05:47:53,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 05:47:53,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:47:53,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-13 05:47:53,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:47:53,594 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 05:47:53,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:47:58,288 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 05:47:58,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389591691] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:47:58,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:47:58,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-09-13 05:47:58,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555240342] [2024-09-13 05:47:58,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:47:58,289 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-13 05:47:58,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:47:58,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-13 05:47:58,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-09-13 05:47:58,290 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 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 05:47:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:47:59,817 INFO L93 Difference]: Finished difference Result 100 states and 155 transitions. [2024-09-13 05:47:59,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-13 05:47:59,818 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 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 05:47:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:47:59,819 INFO L225 Difference]: With dead ends: 100 [2024-09-13 05:47:59,819 INFO L226 Difference]: Without dead ends: 100 [2024-09-13 05:47:59,820 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-09-13 05:47:59,820 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 39 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-13 05:47:59,820 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 319 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-13 05:47:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-09-13 05:47:59,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 78. [2024-09-13 05:47:59,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 49 states have internal predecessors, (60), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-13 05:47:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2024-09-13 05:47:59,828 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 55 [2024-09-13 05:47:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:47:59,828 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2024-09-13 05:47:59,829 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 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 05:47:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2024-09-13 05:47:59,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-13 05:47:59,830 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:47:59,830 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 05:47:59,837 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-13 05:48:00,034 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 05:48:00,035 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 05:48:00,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:00,035 INFO L85 PathProgramCache]: Analyzing trace with hash -550970448, now seen corresponding path program 1 times [2024-09-13 05:48:00,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:00,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163935444] [2024-09-13 05:48:00,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:00,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:01,681 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:48:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:01,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:48:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:01,687 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:48:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:01,690 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:48:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:01,697 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:48:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:01,705 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:48:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:01,712 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 05:48:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:01,729 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 05:48:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:01,745 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 05:48:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:01,764 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 05:48:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:01,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 05:48:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:01,789 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 05:48:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:01,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163935444] [2024-09-13 05:48:01,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163935444] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:48:01,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396645376] [2024-09-13 05:48:01,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:01,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:48:01,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:48:01,791 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 05:48:01,793 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 05:48:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:01,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-13 05:48:01,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:48:02,259 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 05:48:02,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:48:02,997 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 05:48:02,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396645376] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:48:02,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:48:02,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2024-09-13 05:48:02,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012937573] [2024-09-13 05:48:02,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:48:02,998 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-13 05:48:02,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:02,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-13 05:48:02,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-09-13 05:48:02,999 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 9 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 9 states have call predecessors, (25), 9 states have call successors, (25) [2024-09-13 05:48:03,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:03,199 INFO L93 Difference]: Finished difference Result 95 states and 143 transitions. [2024-09-13 05:48:03,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-13 05:48:03,200 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 9 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 9 states have call predecessors, (25), 9 states have call successors, (25) Word has length 69 [2024-09-13 05:48:03,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:03,201 INFO L225 Difference]: With dead ends: 95 [2024-09-13 05:48:03,201 INFO L226 Difference]: Without dead ends: 95 [2024-09-13 05:48:03,201 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 151 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-09-13 05:48:03,202 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:48:03,202 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 124 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 05:48:03,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-13 05:48:03,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2024-09-13 05:48:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 55 states have internal predecessors, (66), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-09-13 05:48:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-09-13 05:48:03,211 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 69 [2024-09-13 05:48:03,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:03,211 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-09-13 05:48:03,211 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 9 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 9 states have call predecessors, (25), 9 states have call successors, (25) [2024-09-13 05:48:03,211 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-09-13 05:48:03,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-13 05:48:03,212 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:03,213 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 05:48:03,227 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 05:48:03,413 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 05:48:03,413 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 05:48:03,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:03,414 INFO L85 PathProgramCache]: Analyzing trace with hash -493891693, now seen corresponding path program 3 times [2024-09-13 05:48:03,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:03,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381328577] [2024-09-13 05:48:03,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:03,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:48:03,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [743660897] [2024-09-13 05:48:03,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 05:48:03,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:48:03,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:48:03,580 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 05:48:03,582 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 05:48:04,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-13 05:48:04,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:48:04,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-13 05:48:04,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:48:07,884 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-09-13 05:48:07,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:48:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-09-13 05:48:20,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:20,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381328577] [2024-09-13 05:48:20,658 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:48:20,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743660897] [2024-09-13 05:48:20,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743660897] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 05:48:20,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 05:48:20,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-09-13 05:48:20,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094936192] [2024-09-13 05:48:20,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:48:20,659 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 05:48:20,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:20,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 05:48:20,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-09-13 05:48:20,659 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 05:48:23,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:48:27,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:48:28,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:48:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:29,034 INFO L93 Difference]: Finished difference Result 101 states and 154 transitions. [2024-09-13 05:48:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 05:48:29,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 05:48:29,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:29,036 INFO L225 Difference]: With dead ends: 101 [2024-09-13 05:48:29,036 INFO L226 Difference]: Without dead ends: 101 [2024-09-13 05:48:29,036 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-09-13 05:48:29,037 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:48:29,038 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-09-13 05:48:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-09-13 05:48:29,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2024-09-13 05:48:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 57 states have internal predecessors, (70), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-09-13 05:48:29,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2024-09-13 05:48:29,048 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 73 [2024-09-13 05:48:29,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:29,054 INFO L474 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2024-09-13 05:48:29,054 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 05:48:29,054 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2024-09-13 05:48:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-13 05:48:29,058 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:29,058 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 05:48:29,074 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 05:48:29,259 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 05:48:29,259 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 05:48:29,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:29,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1381978582, now seen corresponding path program 1 times [2024-09-13 05:48:29,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:29,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061478972] [2024-09-13 05:48:29,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:29,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:48:29,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641275036] [2024-09-13 05:48:29,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:29,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:48:29,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:48:29,442 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 05:48:29,443 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 05:48:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:29,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-13 05:48:29,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:48:29,650 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 05:48:29,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:48:29,838 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 05:48:29,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:29,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061478972] [2024-09-13 05:48:29,839 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:48:29,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641275036] [2024-09-13 05:48:29,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641275036] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:48:29,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 05:48:29,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-09-13 05:48:29,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263240549] [2024-09-13 05:48:29,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 05:48:29,839 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 05:48:29,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:29,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 05:48:29,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-13 05:48:29,840 INFO L87 Difference]: Start difference. First operand 92 states and 136 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 05:48:30,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:30,184 INFO L93 Difference]: Finished difference Result 101 states and 150 transitions. [2024-09-13 05:48:30,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 05:48:30,185 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 05:48:30,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:30,186 INFO L225 Difference]: With dead ends: 101 [2024-09-13 05:48:30,186 INFO L226 Difference]: Without dead ends: 101 [2024-09-13 05:48:30,186 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 05:48:30,187 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:48:30,187 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 66 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 05:48:30,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-09-13 05:48:30,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2024-09-13 05:48:30,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 52 states have internal predecessors, (66), 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 05:48:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 126 transitions. [2024-09-13 05:48:30,198 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 126 transitions. Word has length 82 [2024-09-13 05:48:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:30,199 INFO L474 AbstractCegarLoop]: Abstraction has 85 states and 126 transitions. [2024-09-13 05:48:30,199 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 05:48:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 126 transitions. [2024-09-13 05:48:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-13 05:48:30,204 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:30,204 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:48:30,220 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 05:48:30,404 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 05:48:30,405 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:48:30,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:30,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2013859210, now seen corresponding path program 1 times [2024-09-13 05:48:30,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:30,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771037847] [2024-09-13 05:48:30,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:30,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:30,754 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:48:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:30,756 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:48:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:30,758 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:48:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:30,761 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:48:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:30,764 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:48:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:30,767 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:48:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:30,769 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 05:48:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:30,773 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 05:48:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:30,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 05:48:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:30,780 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 05:48:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:30,783 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 05:48:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:30,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-13 05:48:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:30,792 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 05:48:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:30,796 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 05:48:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 05:48:30,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:30,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771037847] [2024-09-13 05:48:30,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771037847] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:48:30,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062135397] [2024-09-13 05:48:30,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:30,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:48:30,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:48:30,804 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 05:48:30,806 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 05:48:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:30,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-13 05:48:30,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:48:42,890 WARN L293 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:48:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 05:48:55,939 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 05:48:55,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062135397] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:48:55,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 05:48:55,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-09-13 05:48:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587463847] [2024-09-13 05:48:55,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:48:55,940 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 05:48:55,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:55,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 05:48:55,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-09-13 05:48:55,943 INFO L87 Difference]: Start difference. First operand 85 states and 126 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-09-13 05:48:57,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:48:58,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:58,825 INFO L93 Difference]: Finished difference Result 109 states and 168 transitions. [2024-09-13 05:48:58,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 05:48:58,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 85 [2024-09-13 05:48:58,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:58,827 INFO L225 Difference]: With dead ends: 109 [2024-09-13 05:48:58,827 INFO L226 Difference]: Without dead ends: 109 [2024-09-13 05:48:58,827 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-09-13 05:48:58,828 INFO L434 NwaCegarLoop]: 65 mSDtfsCounter, 20 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-09-13 05:48:58,828 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 147 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-09-13 05:48:58,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-09-13 05:48:58,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2024-09-13 05:48:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 66 states have internal predecessors, (92), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-09-13 05:48:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 168 transitions. [2024-09-13 05:48:58,834 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 168 transitions. Word has length 85 [2024-09-13 05:48:58,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:58,835 INFO L474 AbstractCegarLoop]: Abstraction has 107 states and 168 transitions. [2024-09-13 05:48:58,835 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-09-13 05:48:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 168 transitions. [2024-09-13 05:48:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-13 05:48:58,836 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:58,836 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 05:48:58,852 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-13 05:48:59,040 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 05:48:59,041 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:48:59,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:59,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1551961905, now seen corresponding path program 1 times [2024-09-13 05:48:59,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:59,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402255220] [2024-09-13 05:48:59,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:59,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:59,673 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:48:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:59,675 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:48:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:59,677 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:48:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:59,678 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:48:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:59,684 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:48:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:59,688 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:48:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:59,694 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 05:48:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:59,704 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 05:48:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:59,714 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 05:48:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:59,723 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 05:48:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:59,730 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 05:48:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:59,736 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-13 05:48:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:59,740 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-13 05:48:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:59,745 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 05:48:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:59,750 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 05:48:59,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:59,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402255220] [2024-09-13 05:48:59,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402255220] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:48:59,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515956333] [2024-09-13 05:48:59,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:59,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:48:59,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:48:59,752 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 05:48:59,760 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 05:48:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:59,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-13 05:48:59,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:49:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-09-13 05:49:03,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:49:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-09-13 05:49:04,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515956333] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 05:49:04,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 05:49:04,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 5] total 12 [2024-09-13 05:49:04,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260730089] [2024-09-13 05:49:04,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:49:04,359 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:49:04,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:49:04,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:49:04,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-09-13 05:49:04,360 INFO L87 Difference]: Start difference. First operand 107 states and 168 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 05:49:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:49:04,572 INFO L93 Difference]: Finished difference Result 106 states and 167 transitions. [2024-09-13 05:49:04,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:49:04,573 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 87 [2024-09-13 05:49:04,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:49:04,573 INFO L225 Difference]: With dead ends: 106 [2024-09-13 05:49:04,573 INFO L226 Difference]: Without dead ends: 93 [2024-09-13 05:49:04,574 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-09-13 05:49:04,574 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:49:04,574 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 66 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 05:49:04,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-13 05:49:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 69. [2024-09-13 05:49:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-13 05:49:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 101 transitions. [2024-09-13 05:49:04,580 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 101 transitions. Word has length 87 [2024-09-13 05:49:04,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:49:04,580 INFO L474 AbstractCegarLoop]: Abstraction has 69 states and 101 transitions. [2024-09-13 05:49:04,580 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 05:49:04,580 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2024-09-13 05:49:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-13 05:49:04,582 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:49:04,583 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 05:49:04,600 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 05:49:04,783 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 05:49:04,783 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 05:49:04,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:49:04,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1137425730, now seen corresponding path program 2 times [2024-09-13 05:49:04,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:49:04,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600420947] [2024-09-13 05:49:04,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:49:04,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:49:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:06,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:49:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:06,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:49:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:06,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:49:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:06,402 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:49:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:06,409 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:49:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:06,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:49:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:06,421 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 05:49:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:06,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 05:49:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:06,433 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 05:49:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:06,440 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 05:49:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:06,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 05:49:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:06,457 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-13 05:49:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:06,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 05:49:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:06,476 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 05:49:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:06,487 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 05:49:06,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:49:06,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600420947] [2024-09-13 05:49:06,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600420947] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:49:06,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011817049] [2024-09-13 05:49:06,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 05:49:06,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:49:06,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:49:06,489 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 05:49:06,491 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 05:49:06,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 05:49:06,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:49:06,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-13 05:49:06,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:49:08,106 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 05:49:08,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:49:28,255 WARN L293 SmtUtils]: Spent 7.34s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:49:34,753 WARN L293 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 91 DAG size of output: 88 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 05:49:37,225 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 05:49:37,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011817049] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:49:37,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:49:37,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2024-09-13 05:49:37,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876639878] [2024-09-13 05:49:37,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:49:37,226 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-13 05:49:37,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:49:37,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-13 05:49:37,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-09-13 05:49:37,227 INFO L87 Difference]: Start difference. First operand 69 states and 101 transitions. Second operand has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 19 states have internal predecessors, (49), 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 05:49:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:49:38,528 INFO L93 Difference]: Finished difference Result 85 states and 132 transitions. [2024-09-13 05:49:38,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-13 05:49:38,529 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 19 states have internal predecessors, (49), 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 05:49:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:49:38,530 INFO L225 Difference]: With dead ends: 85 [2024-09-13 05:49:38,530 INFO L226 Difference]: Without dead ends: 85 [2024-09-13 05:49:38,530 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 187 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-09-13 05:49:38,531 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-09-13 05:49:38,531 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 322 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-09-13 05:49:38,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-09-13 05:49:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2024-09-13 05:49:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 46 states have internal predecessors, (58), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-13 05:49:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 112 transitions. [2024-09-13 05:49:38,543 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 112 transitions. Word has length 87 [2024-09-13 05:49:38,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:49:38,544 INFO L474 AbstractCegarLoop]: Abstraction has 75 states and 112 transitions. [2024-09-13 05:49:38,544 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 19 states have internal predecessors, (49), 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 05:49:38,544 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2024-09-13 05:49:38,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-09-13 05:49:38,545 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:49:38,545 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 05:49:38,566 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-13 05:49:38,745 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 05:49:38,745 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 05:49:38,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:49:38,746 INFO L85 PathProgramCache]: Analyzing trace with hash -296419461, now seen corresponding path program 1 times [2024-09-13 05:49:38,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:49:38,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737863191] [2024-09-13 05:49:38,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:49:38,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:49:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:49:38,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255886103] [2024-09-13 05:49:38,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:49:38,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:49:38,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:49:38,872 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 05:49:38,878 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 05:49:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:38,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-13 05:49:38,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:49:53,012 WARN L293 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:50:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-13 05:50:14,244 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 05:50:14,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:50:14,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737863191] [2024-09-13 05:50:14,245 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:50:14,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255886103] [2024-09-13 05:50:14,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255886103] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:50:14,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:50:14,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 05:50:14,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106281438] [2024-09-13 05:50:14,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:50:14,245 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 05:50:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:50:14,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 05:50:14,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-09-13 05:50:14,246 INFO L87 Difference]: Start difference. First operand 75 states and 112 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-13 05:50:18,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:50:19,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:50:19,349 INFO L93 Difference]: Finished difference Result 89 states and 135 transitions. [2024-09-13 05:50:19,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 05:50:19,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 91 [2024-09-13 05:50:19,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:50:19,350 INFO L225 Difference]: With dead ends: 89 [2024-09-13 05:50:19,350 INFO L226 Difference]: Without dead ends: 89 [2024-09-13 05:50:19,350 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-09-13 05:50:19,350 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:50:19,351 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 132 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-09-13 05:50:19,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-09-13 05:50:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2024-09-13 05:50:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.1875) internal successors, (57), 46 states have internal predecessors, (57), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-13 05:50:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2024-09-13 05:50:19,355 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 111 transitions. Word has length 91 [2024-09-13 05:50:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:50:19,356 INFO L474 AbstractCegarLoop]: Abstraction has 75 states and 111 transitions. [2024-09-13 05:50:19,356 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-13 05:50:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2024-09-13 05:50:19,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-09-13 05:50:19,357 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:50:19,357 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 05:50:19,371 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 05:50:19,557 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 05:50:19,558 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 05:50:19,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:50:19,558 INFO L85 PathProgramCache]: Analyzing trace with hash -436202417, now seen corresponding path program 3 times [2024-09-13 05:50:19,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:50:19,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650357182] [2024-09-13 05:50:19,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:50:19,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:50:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:50:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,458 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:50:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:50:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,461 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:50:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:50:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,472 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:50:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,478 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 05:50:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,482 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 05:50:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 05:50:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,493 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 05:50:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,503 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 05:50:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-13 05:50:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 05:50:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,537 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 05:50:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,549 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-09-13 05:50:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,561 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-13 05:50:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:50:22,573 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 05:50:22,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:50:22,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650357182] [2024-09-13 05:50:22,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650357182] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:50:22,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490092351] [2024-09-13 05:50:22,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 05:50:22,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:50:22,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:50:22,576 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 05:50:22,580 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 05:50:22,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-13 05:50:22,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:50:22,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-13 05:50:22,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:50:23,365 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 05:50:23,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:50:55,738 WARN L293 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 112 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 05:51:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-09-13 05:51:37,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490092351] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:51:37,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:51:37,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 27 [2024-09-13 05:51:37,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507939807] [2024-09-13 05:51:37,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:51:37,426 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-13 05:51:37,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:51:37,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-13 05:51:37,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2024-09-13 05:51:37,427 INFO L87 Difference]: Start difference. First operand 75 states and 111 transitions. Second operand has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 28 states have internal predecessors, (65), 14 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 14 states have call predecessors, (42), 14 states have call successors, (42) [2024-09-13 05:51:53,367 WARN L293 SmtUtils]: Spent 15.18s on a formula simplification that was a NOOP. DAG size: 206 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 05:52:00,796 WARN L293 SmtUtils]: Spent 6.92s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 05:52:11,465 WARN L293 SmtUtils]: Spent 10.26s on a formula simplification that was a NOOP. DAG size: 167 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 05:52:14,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:52:14,108 INFO L93 Difference]: Finished difference Result 90 states and 126 transitions. [2024-09-13 05:52:14,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-13 05:52:14,108 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 28 states have internal predecessors, (65), 14 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 14 states have call predecessors, (42), 14 states have call successors, (42) Word has length 101 [2024-09-13 05:52:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:52:14,109 INFO L225 Difference]: With dead ends: 90 [2024-09-13 05:52:14,109 INFO L226 Difference]: Without dead ends: 72 [2024-09-13 05:52:14,109 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 46.5s TimeCoverageRelationStatistics Valid=320, Invalid=940, Unknown=0, NotChecked=0, Total=1260 [2024-09-13 05:52:14,110 INFO L434 NwaCegarLoop]: 54 mSDtfsCounter, 26 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:52:14,110 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 263 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-09-13 05:52:14,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-13 05:52:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2024-09-13 05:52:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-13 05:52:14,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2024-09-13 05:52:14,113 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 101 [2024-09-13 05:52:14,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:52:14,114 INFO L474 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2024-09-13 05:52:14,114 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 28 states have internal predecessors, (65), 14 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 14 states have call predecessors, (42), 14 states have call successors, (42) [2024-09-13 05:52:14,114 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2024-09-13 05:52:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-09-13 05:52:14,115 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:52:14,115 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:52:14,136 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-13 05:52:14,315 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 05:52:14,316 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:52:14,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:52:14,316 INFO L85 PathProgramCache]: Analyzing trace with hash -436202355, now seen corresponding path program 1 times [2024-09-13 05:52:14,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:52:14,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219054672] [2024-09-13 05:52:14,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:52:14,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:52:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:16,908 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:52:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:16,911 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:52:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:16,936 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:52:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:16,938 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:52:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:16,943 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:52:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:16,947 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:52:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:16,951 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 05:52:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:16,957 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 05:52:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:16,963 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 05:52:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:16,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 05:52:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:16,977 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 05:52:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:16,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-13 05:52:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:16,993 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 05:52:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:17,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 05:52:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:17,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-09-13 05:52:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:17,017 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-13 05:52:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-09-13 05:52:17,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:52:17,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219054672] [2024-09-13 05:52:17,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219054672] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:52:17,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577455780] [2024-09-13 05:52:17,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:52:17,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:52:17,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:52:17,029 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 05:52:17,029 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 05:52:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:17,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-13 05:52:17,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:52:17,831 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 05:52:17,831 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:52:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-09-13 05:52:26,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577455780] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 05:52:26,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 05:52:26,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14, 10] total 26 [2024-09-13 05:52:26,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130307328] [2024-09-13 05:52:26,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:52:26,481 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:52:26,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:52:26,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:52:26,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2024-09-13 05:52:26,482 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-13 05:52:26,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:52:26,665 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2024-09-13 05:52:26,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:52:26,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2024-09-13 05:52:26,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:52:26,666 INFO L225 Difference]: With dead ends: 69 [2024-09-13 05:52:26,666 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 05:52:26,666 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2024-09-13 05:52:26,667 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:52:26,668 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 89 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 05:52:26,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 05:52:26,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-13 05:52:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 05:52:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-09-13 05:52:26,670 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 101 [2024-09-13 05:52:26,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:52:26,671 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-09-13 05:52:26,671 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-13 05:52:26,671 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-09-13 05:52:26,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-09-13 05:52:26,672 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:52:26,672 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 05:52:26,684 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-09-13 05:52:26,872 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 05:52:26,873 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 05:52:26,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:52:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1495614028, now seen corresponding path program 4 times [2024-09-13 05:52:26,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:52:26,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447123543] [2024-09-13 05:52:26,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:52:26,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:52:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:52:27,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [122368612] [2024-09-13 05:52:27,063 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-13 05:52:27,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:52:27,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:52:27,065 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 05:52:27,066 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 05:52:27,147 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-13 05:52:27,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-09-13 05:52:27,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-13 05:52:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 05:52:27,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-13 05:52:27,251 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-13 05:52:27,255 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 12 remaining) [2024-09-13 05:52:27,256 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 12 remaining) [2024-09-13 05:52:27,256 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (9 of 12 remaining) [2024-09-13 05:52:27,257 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (8 of 12 remaining) [2024-09-13 05:52:27,257 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (7 of 12 remaining) [2024-09-13 05:52:27,258 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (6 of 12 remaining) [2024-09-13 05:52:27,258 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION (5 of 12 remaining) [2024-09-13 05:52:27,258 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION (4 of 12 remaining) [2024-09-13 05:52:27,258 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION (3 of 12 remaining) [2024-09-13 05:52:27,258 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 12 remaining) [2024-09-13 05:52:27,258 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2024-09-13 05:52:27,258 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 12 remaining) [2024-09-13 05:52:27,272 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 05:52:27,458 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 05:52:27,461 INFO L408 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:52:27,479 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-13 05:52:27,480 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 05:52:27,480 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 05:52:27,484 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 05:52:27,484 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-13 05:52:27,484 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 05:52:27,485 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 05:52:27,485 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 05:52:27,485 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-13 05:52:27,486 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 05:52:27,486 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 05:52:27,486 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 05:52:27,487 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-13 05:52:27,487 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 05:52:27,491 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 05:52:27,491 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 05:52:27,492 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-13 05:52:27,492 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 05:52:27,492 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 05:52:27,494 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-13 05:52:27,496 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-09-13 05:52:27,508 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 05:52:27,510 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-13 05:52:27,510 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-13 05:52:27,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 05:52:27 BoogieIcfgContainer [2024-09-13 05:52:27,510 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 05:52:27,511 INFO L158 Benchmark]: Toolchain (without parser) took 291485.15ms. Allocated memory was 157.3MB in the beginning and 685.8MB in the end (delta: 528.5MB). Free memory was 119.9MB in the beginning and 422.4MB in the end (delta: -302.5MB). Peak memory consumption was 226.0MB. Max. memory is 16.1GB. [2024-09-13 05:52:27,511 INFO L158 Benchmark]: Witness Parser took 0.51ms. Allocated memory is still 157.3MB. Free memory was 120.8MB in the beginning and 120.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:52:27,512 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 157.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:52:27,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.36ms. Allocated memory is still 157.3MB. Free memory was 119.9MB in the beginning and 103.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-09-13 05:52:27,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.10ms. Allocated memory is still 157.3MB. Free memory was 103.4MB in the beginning and 95.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-13 05:52:27,513 INFO L158 Benchmark]: Boogie Preprocessor took 104.41ms. Allocated memory is still 157.3MB. Free memory was 95.0MB in the beginning and 90.9MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-13 05:52:27,513 INFO L158 Benchmark]: RCFGBuilder took 874.72ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 90.9MB in the beginning and 186.6MB in the end (delta: -95.7MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-09-13 05:52:27,513 INFO L158 Benchmark]: TraceAbstraction took 290073.04ms. Allocated memory was 226.5MB in the beginning and 685.8MB in the end (delta: 459.3MB). Free memory was 185.8MB in the beginning and 422.4MB in the end (delta: -236.6MB). Peak memory consumption was 225.8MB. Max. memory is 16.1GB. [2024-09-13 05:52:27,515 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.51ms. Allocated memory is still 157.3MB. Free memory was 120.8MB in the beginning and 120.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.85ms. Allocated memory is still 157.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.36ms. Allocated memory is still 157.3MB. Free memory was 119.9MB in the beginning and 103.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.10ms. Allocated memory is still 157.3MB. Free memory was 103.4MB in the beginning and 95.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.41ms. Allocated memory is still 157.3MB. Free memory was 95.0MB in the beginning and 90.9MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 874.72ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 90.9MB in the beginning and 186.6MB in the end (delta: -95.7MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * TraceAbstraction took 290073.04ms. Allocated memory was 226.5MB in the beginning and 685.8MB in the end (delta: 459.3MB). Free memory was 185.8MB in the beginning and 422.4MB in the end (delta: -236.6MB). Peak memory consumption was 225.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 46]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L23] unsigned int A, B; [L24] long long r, d, p, q; [L25] A = __VERIFIER_nondet_uint() [L26] CALL assume_abort_if_not(A>=0 && A<=10) VAL [\old(cond)=1] [L12] COND FALSE !(!cond) VAL [\old(cond)=1] [L26] RET assume_abort_if_not(A>=0 && A<=10) VAL [A=-12884901880] [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B>=0 && B<=10) VAL [\old(cond)=1] [L12] COND FALSE !(!cond) VAL [\old(cond)=1] [L28] RET assume_abort_if_not(B>=0 && B<=10) VAL [A=-12884901880, B=2] [L29] CALL assume_abort_if_not(B >= 1) VAL [\old(cond)=1] [L12] COND FALSE !(!cond) VAL [\old(cond)=1] [L29] RET assume_abort_if_not(B >= 1) VAL [A=-12884901880, B=2] [L31] r = A [L32] d = B [L33] p = 1 [L34] q = 0 VAL [A=-12884901880, B=2, d=2, p=1, q=0, r=8] [L36] COND TRUE 1 VAL [A=-12884901880, B=2, d=2, p=1, q=0, r=8] [L37] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L37] RET __VERIFIER_assert(q == 0) VAL [A=-12884901880, B=2, d=2, p=1, q=0, r=8] [L38] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L38] RET __VERIFIER_assert(r == A) VAL [A=-12884901880, B=2, d=2, p=1, q=0, r=8] [L39] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L39] RET __VERIFIER_assert(d == B * p) VAL [A=-12884901880, B=2, d=2, p=1, q=0, r=8] [L40] COND FALSE !(!(r >= d)) [L42] d = 2 * d [L43] p = 2 * p VAL [A=-12884901880, B=2, d=4, p=2, q=0, r=8] [L36] COND TRUE 1 VAL [A=-12884901880, B=2, d=4, p=2, q=0, r=8] [L37] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L37] RET __VERIFIER_assert(q == 0) VAL [A=-12884901880, B=2, d=4, p=2, q=0, r=8] [L38] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L38] RET __VERIFIER_assert(r == A) VAL [A=-12884901880, B=2, d=4, p=2, q=0, r=8] [L39] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L39] RET __VERIFIER_assert(d == B * p) VAL [A=-12884901880, B=2, d=4, p=2, q=0, r=8] [L40] COND FALSE !(!(r >= d)) [L42] d = 2 * d [L43] p = 2 * p VAL [A=-12884901880, B=2, d=8, p=4, q=0, r=8] [L36] COND TRUE 1 VAL [A=-12884901880, B=2, d=8, p=4, q=0, r=8] [L37] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L37] RET __VERIFIER_assert(q == 0) VAL [A=-12884901880, B=2, d=8, p=4, q=0, r=8] [L38] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L38] RET __VERIFIER_assert(r == A) VAL [A=-12884901880, B=2, d=8, p=4, q=0, r=8] [L39] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L39] RET __VERIFIER_assert(d == B * p) VAL [A=-12884901880, B=2, d=8, p=4, q=0, r=8] [L40] COND FALSE !(!(r >= d)) [L42] d = 2 * d [L43] p = 2 * p VAL [A=-12884901880, B=2, d=16, p=8, q=0, r=8] [L36] COND TRUE 1 VAL [A=-12884901880, B=2, d=16, p=8, q=0, r=8] [L37] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L37] RET __VERIFIER_assert(q == 0) VAL [A=-12884901880, B=2, d=16, p=8, q=0, r=8] [L38] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L38] RET __VERIFIER_assert(r == A) VAL [A=-12884901880, B=2, d=16, p=8, q=0, r=8] [L39] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L39] RET __VERIFIER_assert(d == B * p) VAL [A=-12884901880, B=2, d=16, p=8, q=0, r=8] [L40] COND TRUE !(r >= d) VAL [A=-12884901880, B=2, d=16, p=8, q=0, r=8] [L46] COND TRUE 1 VAL [A=-12884901880, B=2, d=16, p=8, q=0, r=8] [L47] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L47] RET __VERIFIER_assert(A == q*B + r) VAL [A=-12884901880, B=2, d=16, p=8, q=0, r=8] [L48] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L48] RET __VERIFIER_assert(d == B*p) VAL [A=-12884901880, B=2, d=16, p=8, q=0, r=8] [L50] COND FALSE !(!(p != 1)) [L52] d = d / 2 [L53] p = p / 2 VAL [A=-12884901880, B=2, d=8, p=4, q=0, r=8] [L54] COND TRUE r >= d [L55] r = r - d [L56] q = q + p VAL [A=-12884901880, B=2, d=8, p=4, q=4, r=0] - UnprovableResult [Line: 36]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that procedure postcondition always holds Unable to prove that procedure postcondition always holds Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure postcondition always holds Unable to prove that procedure postcondition always holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 43 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 290.0s, OverallIterations: 19, TraceHistogramMax: 14, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 58.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 291 SdHoareTripleChecker+Valid, 20.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 208 mSDsluCounter, 2316 SdHoareTripleChecker+Invalid, 19.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1538 mSDsCounter, 209 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2044 IncrementalHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 209 mSolverCounterUnsat, 778 mSDtfsCounter, 2044 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1926 GetRequests, 1743 SyntacticMatches, 17 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 67.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=13, InterpolantAutomatonStates: 127, 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, 18 MinimizatonAttempts, 124 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 225.4s InterpolantComputationTime, 2178 NumberOfCodeBlocks, 2107 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2329 ConstructedInterpolants, 0 QuantifiedInterpolants, 34051 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2004 ConjunctsInSsa, 232 ConjunctsInUnsatCore, 35 InterpolantComputations, 12 PerfectInterpolantSequences, 5767/6052 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 RESULT: Ultimate proved your program to be incorrect! [2024-09-13 05:52:27,737 WARN L435 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-09-13 05:52:27,766 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE