This is Ultimate 0.2.4-dev-1d5fa63-m [2024-09-13 10:19:11,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 10:19:11,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 10:19:11,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 10:19:11,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 10:19:11,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 10:19:11,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 10:19:11,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 10:19:11,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 10:19:11,989 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 10:19:11,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 10:19:11,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 10:19:11,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 10:19:11,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 10:19:11,992 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 10:19:11,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 10:19:11,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 10:19:11,993 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 10:19:11,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 10:19:11,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 10:19:11,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 10:19:11,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 10:19:11,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 10:19:11,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 10:19:11,996 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 10:19:11,996 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 10:19:11,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 10:19:11,997 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 10:19:11,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 10:19:11,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 10:19:11,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 10:19:11,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 10:19:11,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:19:11,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 10:19:11,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 10:19:11,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 10:19:11,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 10:19:11,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 10:19:11,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 10:19:11,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 10:19:11,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 10:19:12,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 10:19:12,000 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-13 10:19:12,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 10:19:12,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 10:19:12,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 10:19:12,227 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 10:19:12,227 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 10:19:12,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound2.c [2024-09-13 10:19:13,514 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 10:19:13,637 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 10:19:13,638 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound2.c [2024-09-13 10:19:13,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/817f7653b/5155639f1110456ea57a1bd90466dca0/FLAGac68f1f83 [2024-09-13 10:19:13,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/817f7653b/5155639f1110456ea57a1bd90466dca0 [2024-09-13 10:19:13,655 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 10:19:13,658 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 10:19:13,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/hard-u_valuebound2.yml/witness-2.1.yml [2024-09-13 10:19:13,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 10:19:13,695 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 10:19:13,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 10:19:13,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 10:19:13,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 10:19:13,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:19:13" (1/2) ... [2024-09-13 10:19:13,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5747c757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:19:13, skipping insertion in model container [2024-09-13 10:19:13,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:19:13" (1/2) ... [2024-09-13 10:19:13,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@f518e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:19:13, skipping insertion in model container [2024-09-13 10:19:13,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:19:13" (2/2) ... [2024-09-13 10:19:13,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5747c757 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:13, skipping insertion in model container [2024-09-13 10:19:13,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:19:13" (2/2) ... [2024-09-13 10:19:13,709 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 10:19:13,709 INFO L1541 ArrayList]: Loop invariant at [L36-L44] ((((((((B % 4294967296) <= 2) && (((A / 4294967296) * 4294967296) <= r)) && (1 <= (B % 4294967296))) && ((A + ((r / 4294967296) * 4294967296)) == (r + ((A / 4294967296) * 4294967296)))) && (q == 0)) && ((A % 4294967296) <= 2)) && ((d % 4294967296) == (((unsigned long long) B * p) % 4294967296))) [2024-09-13 10:19:13,709 INFO L1541 ArrayList]: Loop invariant at [L46-L58] (((((((B % 4294967296) <= 2) && ((r % 4294967296) == (A % 4294967296))) && (1 <= (B % 4294967296))) && (q == 0)) && ((A % 4294967296) <= 2)) && ((d % 4294967296) == (((unsigned long long) B * p) % 4294967296))) [2024-09-13 10:19:13,709 INFO L1541 ArrayList]: Function contract at [L14]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-13 10:19:13,709 INFO L1541 ArrayList]: Function contract at [L11]: requires null, ensures (\old(cond) != 0) [2024-09-13 10:19:13,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 10:19:13,849 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-u_valuebound2.c[537,550] [2024-09-13 10:19:13,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:19:13,872 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 10:19:13,897 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-u_valuebound2.c[537,550] Start Parsing Local Start Parsing Local [2024-09-13 10:19:13,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:19:13,923 INFO L204 MainTranslator]: Completed translation [2024-09-13 10:19:13,923 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:13 WrapperNode [2024-09-13 10:19:13,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 10:19:13,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 10:19:13,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 10:19:13,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 10:19:13,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:13" (1/1) ... [2024-09-13 10:19:13,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:13" (1/1) ... [2024-09-13 10:19:13,962 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-09-13 10:19:13,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 10:19:13,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 10:19:13,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 10:19:13,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 10:19:13,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:13" (1/1) ... [2024-09-13 10:19:13,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:13" (1/1) ... [2024-09-13 10:19:13,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:13" (1/1) ... [2024-09-13 10:19:13,977 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure assume_abort_if_not is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-13 10:19:13,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:13" (1/1) ... [2024-09-13 10:19:13,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:13" (1/1) ... [2024-09-13 10:19:13,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:13" (1/1) ... [2024-09-13 10:19:13,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:13" (1/1) ... [2024-09-13 10:19:13,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:13" (1/1) ... [2024-09-13 10:19:13,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:13" (1/1) ... [2024-09-13 10:19:13,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 10:19:13,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 10:19:13,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 10:19:13,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 10:19:13,993 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:13" (1/1) ... [2024-09-13 10:19:14,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:19:14,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:14,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 10:19:14,028 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 10:19:14,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 10:19:14,066 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 10:19:14,066 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 10:19:14,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 10:19:14,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 10:19:14,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 10:19:14,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 10:19:14,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 10:19:14,118 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 10:19:14,119 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 10:19:14,304 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 10:19:14,320 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-09-13 10:19:14,321 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 10:19:14,348 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 10:19:14,348 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 10:19:14,348 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:19:14 BoogieIcfgContainer [2024-09-13 10:19:14,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 10:19:14,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 10:19:14,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 10:19:14,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 10:19:14,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 10:19:13" (1/4) ... [2024-09-13 10:19:14,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712b95b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:19:14, skipping insertion in model container [2024-09-13 10:19:14,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:19:13" (2/4) ... [2024-09-13 10:19:14,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712b95b2 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 10:19:14, skipping insertion in model container [2024-09-13 10:19:14,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:19:13" (3/4) ... [2024-09-13 10:19:14,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712b95b2 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 10:19:14, skipping insertion in model container [2024-09-13 10:19:14,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:19:14" (4/4) ... [2024-09-13 10:19:14,357 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound2.c [2024-09-13 10:19:14,373 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 10:19:14,373 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-09-13 10:19:14,406 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 10:19:14,411 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;@43d4aa5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 10:19:14,411 INFO L337 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-09-13 10:19:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 10:19:14,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 10:19:14,418 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:14,419 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 10:19:14,419 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:14,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:14,423 INFO L85 PathProgramCache]: Analyzing trace with hash 134843102, now seen corresponding path program 1 times [2024-09-13 10:19:14,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:14,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505682250] [2024-09-13 10:19:14,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:14,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:19:14,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:14,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505682250] [2024-09-13 10:19:14,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505682250] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:19:14,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:19:14,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:19:14,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332426113] [2024-09-13 10:19:14,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:19:14,527 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 10:19:14,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:14,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 10:19:14,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 10:19:14,598 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:19:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:14,625 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-09-13 10:19:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 10:19:14,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-13 10:19:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:14,631 INFO L225 Difference]: With dead ends: 43 [2024-09-13 10:19:14,631 INFO L226 Difference]: Without dead ends: 41 [2024-09-13 10:19:14,633 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 10:19:14,634 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:14,635 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:19:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-13 10:19:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-13 10:19:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 29 states have internal predecessors, (32), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 10:19:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2024-09-13 10:19:14,672 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 5 [2024-09-13 10:19:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:14,673 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2024-09-13 10:19:14,673 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:19:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2024-09-13 10:19:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 10:19:14,675 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:14,675 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 10:19:14,675 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 10:19:14,676 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:14,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:14,677 INFO L85 PathProgramCache]: Analyzing trace with hash 134843164, now seen corresponding path program 1 times [2024-09-13 10:19:14,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:14,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340213395] [2024-09-13 10:19:14,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:14,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:19:14,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:14,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340213395] [2024-09-13 10:19:14,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340213395] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:19:14,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:19:14,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:19:14,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398480963] [2024-09-13 10:19:14,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:19:14,761 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:19:14,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:14,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:19:14,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:19:14,766 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:19:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:14,806 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-09-13 10:19:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:19:14,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-13 10:19:14,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:14,808 INFO L225 Difference]: With dead ends: 40 [2024-09-13 10:19:14,808 INFO L226 Difference]: Without dead ends: 40 [2024-09-13 10:19:14,809 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:19:14,810 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:14,811 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:19:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-13 10:19:14,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-09-13 10:19:14,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 10:19:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2024-09-13 10:19:14,819 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 5 [2024-09-13 10:19:14,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:14,819 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-09-13 10:19:14,819 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:19:14,819 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-09-13 10:19:14,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 10:19:14,820 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:14,821 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:14,821 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 10:19:14,821 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:14,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash 363565673, now seen corresponding path program 1 times [2024-09-13 10:19:14,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:14,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673059938] [2024-09-13 10:19:14,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:14,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:19:14,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [283537623] [2024-09-13 10:19:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:14,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:14,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:14,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:19:14,892 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 10:19:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:14,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-13 10:19:14,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 10:19:15,104 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 10:19:15,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:15,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673059938] [2024-09-13 10:19:15,105 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:19:15,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283537623] [2024-09-13 10:19:15,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283537623] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:19:15,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:19:15,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 10:19:15,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368175897] [2024-09-13 10:19:15,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:19:15,106 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 10:19:15,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:15,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 10:19:15,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:19:15,107 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 7 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 10:19:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:15,321 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2024-09-13 10:19:15,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 10:19:15,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2024-09-13 10:19:15,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:15,323 INFO L225 Difference]: With dead ends: 51 [2024-09-13 10:19:15,324 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 10:19:15,324 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:19:15,325 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:15,325 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 113 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:19:15,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 10:19:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-13 10:19:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 34 states have internal predecessors, (38), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 10:19:15,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-09-13 10:19:15,333 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 19 [2024-09-13 10:19:15,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:15,333 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-09-13 10:19:15,334 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 10:19:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-09-13 10:19:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 10:19:15,334 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:15,334 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:15,348 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 10:19:15,538 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:15,539 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:15,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:15,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1764960997, now seen corresponding path program 1 times [2024-09-13 10:19:15,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:15,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210465732] [2024-09-13 10:19:15,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:15,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,679 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,684 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,688 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 10:19:15,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:15,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210465732] [2024-09-13 10:19:15,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210465732] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:19:15,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:19:15,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 10:19:15,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002965777] [2024-09-13 10:19:15,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:19:15,697 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:19:15,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:15,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:19:15,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:19:15,698 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:19:15,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:15,798 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2024-09-13 10:19:15,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:19:15,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 10:19:15,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:15,799 INFO L225 Difference]: With dead ends: 50 [2024-09-13 10:19:15,799 INFO L226 Difference]: Without dead ends: 50 [2024-09-13 10:19:15,800 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 10:19:15,800 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:15,801 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 97 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:19:15,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-13 10:19:15,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-09-13 10:19:15,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.25) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 10:19:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-09-13 10:19:15,805 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 24 [2024-09-13 10:19:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:15,805 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-09-13 10:19:15,806 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:19:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-09-13 10:19:15,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 10:19:15,806 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:15,806 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:15,807 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 10:19:15,807 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:15,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:15,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1764960836, now seen corresponding path program 1 times [2024-09-13 10:19:15,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:15,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799312137] [2024-09-13 10:19:15,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:15,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,847 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,854 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 10:19:15,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:15,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799312137] [2024-09-13 10:19:15,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799312137] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:19:15,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:19:15,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:19:15,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378708014] [2024-09-13 10:19:15,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:19:15,862 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:19:15,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:15,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:19:15,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:19:15,863 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:19:15,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:15,907 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2024-09-13 10:19:15,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:19:15,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 10:19:15,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:15,908 INFO L225 Difference]: With dead ends: 47 [2024-09-13 10:19:15,909 INFO L226 Difference]: Without dead ends: 47 [2024-09-13 10:19:15,909 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:19:15,911 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:15,912 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:19:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-13 10:19:15,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-13 10:19:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 10:19:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2024-09-13 10:19:15,920 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 24 [2024-09-13 10:19:15,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:15,920 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2024-09-13 10:19:15,920 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:19:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2024-09-13 10:19:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 10:19:15,921 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:15,921 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:15,921 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 10:19:15,922 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:15,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:15,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1154352905, now seen corresponding path program 1 times [2024-09-13 10:19:15,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:15,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784663245] [2024-09-13 10:19:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:15,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:19:15,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1774206629] [2024-09-13 10:19:15,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:15,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:15,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:15,955 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:19:15,956 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 10:19:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:16,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-13 10:19:16,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 10:19:16,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:19:28,810 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 10:19:32,817 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse0 (mod |c_ULTIMATE.start_main_~B~0#1| 4294967296)) (.cse3 (mod |c_ULTIMATE.start_main_~r~0#1| 4294967296)) (.cse2 (mod |c_ULTIMATE.start_main_~d~0#1| 4294967296))) (or (< 2 .cse0) (= (mod (* .cse0 (mod |c_ULTIMATE.start_main_~p~0#1| 2147483648)) 2147483648) (mod |c_ULTIMATE.start_main_~d~0#1| 2147483648)) (< 2 .cse1) (not (= .cse2 (mod (* .cse0 (mod |c_ULTIMATE.start_main_~p~0#1| 4294967296)) 4294967296))) (not (= (+ (* (div .cse3 4294967296) 4294967296) .cse1) (+ (* (div .cse1 4294967296) 4294967296) .cse3))) (< .cse0 1) (< .cse3 .cse2))) is different from true [2024-09-13 10:19:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 1 not checked. [2024-09-13 10:19:32,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:32,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784663245] [2024-09-13 10:19:32,833 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:19:32,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774206629] [2024-09-13 10:19:32,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774206629] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:19:32,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 10:19:32,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-09-13 10:19:32,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510989523] [2024-09-13 10:19:32,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 10:19:32,834 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 10:19:32,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:32,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 10:19:32,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=26, Unknown=2, NotChecked=10, Total=56 [2024-09-13 10:19:32,835 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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 10:19:36,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 10:20:05,269 WARN L293 SmtUtils]: Spent 28.28s on a formula simplification. DAG size of input: 40 DAG size of output: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 10:20:09,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:20:13,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:20:17,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:20:21,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:20:25,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:20:29,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:20:33,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 10:20:37,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 10:20:41,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:20:45,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:20:49,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:20:53,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:20:57,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:01,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:05,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:09,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:13,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:17,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:21,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:25,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:29,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:33,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:37,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:41,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:42,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:46,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:50,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:55,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:21:59,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:22:03,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:22:07,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:22:11,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 10:22:11,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:22:11,098 INFO L93 Difference]: Finished difference Result 61 states and 89 transitions. [2024-09-13 10:22:11,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 10:22:11,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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 10:22:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:22:11,099 INFO L225 Difference]: With dead ends: 61 [2024-09-13 10:22:11,099 INFO L226 Difference]: Without dead ends: 61 [2024-09-13 10:22:11,099 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=24, Invalid=34, Unknown=2, NotChecked=12, Total=72 [2024-09-13 10:22:11,100 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 30 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 29 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 129.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 129.9s IncrementalHoareTripleChecker+Time [2024-09-13 10:22:11,101 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 115 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 69 Invalid, 32 Unknown, 88 Unchecked, 129.9s Time] [2024-09-13 10:22:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-13 10:22:11,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2024-09-13 10:22:11,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-13 10:22:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2024-09-13 10:22:11,110 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 37 [2024-09-13 10:22:11,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:22:11,110 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2024-09-13 10:22:11,110 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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 10:22:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2024-09-13 10:22:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-13 10:22:11,111 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:22:11,111 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:22:11,117 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 10:22:11,312 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-13 10:22:11,313 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:22:11,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:22:11,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1515868503, now seen corresponding path program 1 times [2024-09-13 10:22:11,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:22:11,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826042767] [2024-09-13 10:22:11,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:22:11,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:22:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:22:11,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [747661089] [2024-09-13 10:22:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:22:11,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:22:11,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:22:11,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:22:11,340 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 10:22:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:11,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 10:22:11,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:22:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-13 10:22:11,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:22:11,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:22:11,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826042767] [2024-09-13 10:22:11,485 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:22:11,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747661089] [2024-09-13 10:22:11,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747661089] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:22:11,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-13 10:22:11,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-09-13 10:22:11,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616371809] [2024-09-13 10:22:11,486 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-13 10:22:11,486 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:22:11,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:22:11,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:22:11,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 10:22:11,487 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-13 10:22:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:22:11,557 INFO L93 Difference]: Finished difference Result 66 states and 93 transitions. [2024-09-13 10:22:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:22:11,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2024-09-13 10:22:11,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:22:11,559 INFO L225 Difference]: With dead ends: 66 [2024-09-13 10:22:11,559 INFO L226 Difference]: Without dead ends: 66 [2024-09-13 10:22:11,559 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 10:22:11,559 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:22:11,560 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 67 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:22:11,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-13 10:22:11,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-09-13 10:22:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 39 states have internal predecessors, (47), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-13 10:22:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2024-09-13 10:22:11,569 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 50 [2024-09-13 10:22:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:22:11,570 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2024-09-13 10:22:11,570 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-13 10:22:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2024-09-13 10:22:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-13 10:22:11,571 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:22:11,571 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:22:11,585 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 10:22:11,772 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-13 10:22:11,773 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:22:11,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:22:11,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2018739730, now seen corresponding path program 1 times [2024-09-13 10:22:11,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:22:11,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794214950] [2024-09-13 10:22:11,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:22:11,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:22:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:12,262 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:22:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:12,265 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:22:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:12,268 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:22:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:12,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:22:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:12,297 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:22:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:12,332 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:22:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:12,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:22:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:12,388 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:22:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:12,394 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 10:22:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:22:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-13 10:22:12,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:22:12,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794214950] [2024-09-13 10:22:12,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794214950] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:22:12,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:22:12,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 10:22:12,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945340239] [2024-09-13 10:22:12,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:22:12,403 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 10:22:12,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:22:12,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 10:22:12,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:22:12,404 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-13 10:22:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:22:12,542 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2024-09-13 10:22:12,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:22:12,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2024-09-13 10:22:12,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:22:12,546 INFO L225 Difference]: With dead ends: 65 [2024-09-13 10:22:12,546 INFO L226 Difference]: Without dead ends: 58 [2024-09-13 10:22:12,546 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:22:12,546 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:22:12,546 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 165 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:22:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-13 10:22:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-09-13 10:22:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 states have internal predecessors, (43), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-13 10:22:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2024-09-13 10:22:12,555 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 83 transitions. Word has length 55 [2024-09-13 10:22:12,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:22:12,555 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 83 transitions. [2024-09-13 10:22:12,555 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-13 10:22:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2024-09-13 10:22:12,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-13 10:22:12,558 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:22:12,558 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:22:12,558 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 10:22:12,558 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:22:12,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:22:12,558 INFO L85 PathProgramCache]: Analyzing trace with hash -550970448, now seen corresponding path program 1 times [2024-09-13 10:22:12,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:22:12,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921908722] [2024-09-13 10:22:12,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:22:12,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:22:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:22:12,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1944032682] [2024-09-13 10:22:12,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:22:12,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:22:12,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:22:12,593 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:22:12,597 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 10:22:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 10:22:12,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-13 10:22:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 10:22:12,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-13 10:22:12,710 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-13 10:22:12,711 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 12 remaining) [2024-09-13 10:22:12,712 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 12 remaining) [2024-09-13 10:22:12,712 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (9 of 12 remaining) [2024-09-13 10:22:12,712 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (8 of 12 remaining) [2024-09-13 10:22:12,712 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (7 of 12 remaining) [2024-09-13 10:22:12,712 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (6 of 12 remaining) [2024-09-13 10:22:12,712 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION (5 of 12 remaining) [2024-09-13 10:22:12,713 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION (4 of 12 remaining) [2024-09-13 10:22:12,713 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION (3 of 12 remaining) [2024-09-13 10:22:12,713 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 12 remaining) [2024-09-13 10:22:12,713 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2024-09-13 10:22:12,713 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 12 remaining) [2024-09-13 10:22:12,720 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 10:22:12,913 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:22:12,916 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:22:12,930 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-13 10:22:12,937 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-13 10:22:12,937 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-13 10:22:12,938 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-13 10:22:12,939 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-09-13 10:22:12,947 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 10:22:12,948 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-13 10:22:12,948 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-13 10:22:12,949 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 10:22:12 BoogieIcfgContainer [2024-09-13 10:22:12,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 10:22:12,949 INFO L158 Benchmark]: Toolchain (without parser) took 179253.88ms. Allocated memory was 167.8MB in the beginning and 239.1MB in the end (delta: 71.3MB). Free memory was 97.3MB in the beginning and 163.0MB in the end (delta: -65.7MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-09-13 10:22:12,949 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 167.8MB. Free memory was 126.8MB in the beginning and 126.7MB in the end (delta: 153.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:22:12,950 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:22:12,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.08ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 135.4MB in the end (delta: -38.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-09-13 10:22:12,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.96ms. Allocated memory is still 167.8MB. Free memory was 135.1MB in the beginning and 133.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 10:22:12,950 INFO L158 Benchmark]: Boogie Preprocessor took 29.17ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 10:22:12,950 INFO L158 Benchmark]: RCFGBuilder took 356.03ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 109.0MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-09-13 10:22:12,950 INFO L158 Benchmark]: TraceAbstraction took 178599.22ms. Allocated memory was 167.8MB in the beginning and 239.1MB in the end (delta: 71.3MB). Free memory was 109.0MB in the beginning and 163.0MB in the end (delta: -54.0MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-09-13 10:22:12,951 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 167.8MB. Free memory was 126.8MB in the beginning and 126.7MB in the end (delta: 153.9kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.08ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 135.4MB in the end (delta: -38.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.96ms. Allocated memory is still 167.8MB. Free memory was 135.1MB in the beginning and 133.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.17ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 356.03ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 109.0MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 178599.22ms. Allocated memory was 167.8MB in the beginning and 239.1MB in the end (delta: 71.3MB). Free memory was 109.0MB in the beginning and 163.0MB in the end (delta: -54.0MB). Peak memory consumption was 17.1MB. 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: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - 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] unsigned int r, d, p, q; [L25] A = __VERIFIER_nondet_uint() [L26] CALL assume_abort_if_not(A>=0 && A<=2) VAL [\old(cond)=1] [L12] COND FALSE !(!cond) VAL [\old(cond)=1] [L26] RET assume_abort_if_not(A>=0 && A<=2) VAL [A=1] [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B>=0 && B<=2) VAL [\old(cond)=1] [L12] COND FALSE !(!cond) VAL [\old(cond)=1] [L28] RET assume_abort_if_not(B>=0 && B<=2) VAL [A=1, B=-4294967295] [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=1, B=-4294967295] [L31] r = A [L32] d = B [L33] p = 1 [L34] q = 0 VAL [A=1, B=-4294967295, d=-4294967295, p=1, q=0, r=1] [L36] COND TRUE 1 VAL [A=1, B=-4294967295, d=-4294967295, p=1, q=0, r=1] [L37] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1] [L14] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L37] RET __VERIFIER_assert(q == 0) VAL [A=1, B=-4294967295, d=-4294967295, p=1, q=0, r=1] [L38] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1] [L14] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L38] RET __VERIFIER_assert(r == A) VAL [A=1, B=-4294967295, d=-4294967295, p=1, q=0, r=1] [L39] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1] [L14] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L39] RET __VERIFIER_assert(d == B * p) VAL [A=1, B=-4294967295, d=-4294967295, p=1, q=0, r=1] [L40] COND FALSE !(!(r >= d)) [L42] d = 2 * d [L43] p = 2 * p VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L36] COND TRUE 1 VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L37] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1] [L14] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L37] RET __VERIFIER_assert(q == 0) VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L38] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1] [L14] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L38] RET __VERIFIER_assert(r == A) VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L39] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1] [L14] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L39] RET __VERIFIER_assert(d == B * p) VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L40] COND TRUE !(r >= d) VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L46] COND TRUE 1 VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L47] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1] [L14] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L47] RET __VERIFIER_assert(A == q*B + r) VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L48] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1] [L14] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L48] RET __VERIFIER_assert(d == B*p) VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L50] COND FALSE !(!(p != 1)) [L52] d = d / 2 [L53] p = p / 2 VAL [A=1, B=-4294967295, d=1, p=1, q=0, r=1] [L54] COND TRUE r >= d [L55] r = r - d [L56] q = q + p VAL [A=1, B=-4294967295, d=1, p=1, q=1, 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: 178.5s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 159.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 32 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 130.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 794 SdHoareTripleChecker+Invalid, 130.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 88 IncrementalHoareTripleChecker+Unchecked, 501 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 404 IncrementalHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 293 mSDtfsCounter, 404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 36.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 463 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 1978 SizeOfPredicates, 1 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 205/210 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 10:22:13,053 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...