./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/hard-ll_valuebound2.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1d5fa637 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c ../results/automizer-verification-files/SV-COMP24_unreach-call/hard-ll_valuebound2.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-dev-1d5fa63-m [2024-09-13 10:18:46,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 10:18:46,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 10:18:46,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 10:18:46,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 10:18:46,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 10:18:46,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 10:18:46,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 10:18:46,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 10:18:46,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 10:18:46,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 10:18:46,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 10:18:46,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 10:18:46,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 10:18:46,791 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 10:18:46,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 10:18:46,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 10:18:46,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 10:18:46,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 10:18:46,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 10:18:46,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 10:18:46,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 10:18:46,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 10:18:46,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 10:18:46,795 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 10:18:46,795 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 10:18:46,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 10:18:46,795 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 10:18:46,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 10:18:46,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 10:18:46,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 10:18:46,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 10:18:46,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:18:46,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 10:18:46,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 10:18:46,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 10:18:46,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 10:18:46,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 10:18:46,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 10:18:46,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 10:18:46,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 10:18:46,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 10:18:46,799 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-13 10:18:46,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 10:18:47,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 10:18:47,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 10:18:47,018 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 10:18:47,018 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 10:18:47,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/hard-ll_valuebound2.yml/witness-2.1.yml [2024-09-13 10:18:47,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 10:18:47,087 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 10:18:47,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c [2024-09-13 10:18:48,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 10:18:48,480 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 10:18:48,484 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c [2024-09-13 10:18:48,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/fb791c415/c4ebc38a51aa4d8c9dc7f4b9e1bf9cf6/FLAGfc8d5b330 [2024-09-13 10:18:48,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/fb791c415/c4ebc38a51aa4d8c9dc7f4b9e1bf9cf6 [2024-09-13 10:18:48,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 10:18:48,814 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 10:18:48,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 10:18:48,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 10:18:48,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 10:18:48,824 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:18:47" (1/2) ... [2024-09-13 10:18:48,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@605d6a39 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:18:48, skipping insertion in model container [2024-09-13 10:18:48,825 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:18:47" (1/2) ... [2024-09-13 10:18:48,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7addc262 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:18:48, skipping insertion in model container [2024-09-13 10:18:48,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:18:48" (2/2) ... [2024-09-13 10:18:48,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@605d6a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:18:48, skipping insertion in model container [2024-09-13 10:18:48,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:18:48" (2/2) ... [2024-09-13 10:18:48,833 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 10:18:48,835 INFO L1541 ArrayList]: Loop invariant at [L36-L44] (((((((((A % 4294967296) == r) && ((d + ((B / 4294967296) * 4294967296)) == B)) && (q == 0)) && (1 <= d)) && ((A % 4294967296) <= 2)) && (p == 1)) || ((((((((A % 4294967296) == r) && (d == ((long long) 2 * (B % 4294967296)))) && (p == 2)) && (q == 0)) && (1 <= d)) && ((A % 4294967296) <= 2)) && ((B % 4294967296) <= r))) || (((((((0 <= (r + (((__int128) -1 * d) / 2))) && (((A % 4294967296) + d) == (((long long) (B % 4294967296) * 4) + r))) && (q == 0)) && (p == 4)) && (((A % 4294967296) + (d / 2)) == (r + ((long long) 2 * (B % 4294967296))))) && (1 <= d)) && ((A % 4294967296) <= 2))) [2024-09-13 10:18:48,835 INFO L1541 ArrayList]: Loop invariant at [L46-L58] ((((((((((((0 <= r) && (((__int128) r + 1) <= d)) && ((d + r) == (A % 4294967296))) && ((r + ((long long) 2 * (B % 4294967296))) == ((A % 4294967296) + d))) && (q == 1)) && ((A % 4294967296) <= 2)) && (p == 1)) || ((((((r == 0) && (q == 2)) && (p == 2)) && ((((B / 4294967296) * 4294967296) + 1) == B)) && ((A % 4294967296) == 2)) && (d == 2))) || ((((((((A % 4294967296) == r) && (d == ((long long) 2 * (B % 4294967296)))) && (((__int128) r + 1) <= d)) && (p == 2)) && (q == 0)) && ((A % 4294967296) <= 2)) && ((B % 4294967296) <= r))) || (((((((B % 4294967296) == 1) && (r == 0)) && (q == 2)) && ((A % 4294967296) == 2)) && (d == 1)) && (p == 1))) || (((((A % 4294967296) == r) && ((d + ((B / 4294967296) * 4294967296)) == B)) && (q == 0)) && (p == 1))) || (((((((0 <= (r + (((__int128) -1 * d) / 2))) && (((A % 4294967296) + d) == (((long long) (B % 4294967296) * 4) + r))) && (q == 0)) && (p == 4)) && (((A % 4294967296) + (d / 2)) == (r + ((long long) 2 * (B % 4294967296))))) && (1 <= d)) && ((A % 4294967296) <= 2))) [2024-09-13 10:18:48,836 INFO L1541 ArrayList]: Function contract at [L14]: requires (\old(cond) != 0), ensures (\old(cond) != 0) [2024-09-13 10:18:48,836 INFO L1541 ArrayList]: Function contract at [L11]: requires null, ensures (\old(cond) != 0) [2024-09-13 10:18:48,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 10:18:48,977 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c[538,551] [2024-09-13 10:18:49,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:18:49,018 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 10:18:49,045 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c[538,551] Start Parsing Local Start Parsing Local [2024-09-13 10:18:49,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:18:49,081 INFO L204 MainTranslator]: Completed translation [2024-09-13 10:18:49,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:18:49 WrapperNode [2024-09-13 10:18:49,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 10:18:49,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 10:18:49,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 10:18:49,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 10:18:49,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:18:49" (1/1) ... [2024-09-13 10:18:49,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:18:49" (1/1) ... [2024-09-13 10:18:49,125 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-09-13 10:18:49,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 10:18:49,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 10:18:49,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 10:18:49,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 10:18:49,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:18:49" (1/1) ... [2024-09-13 10:18:49,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:18:49" (1/1) ... [2024-09-13 10:18:49,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:18:49" (1/1) ... [2024-09-13 10:18:49,145 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:18:49,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:18:49" (1/1) ... [2024-09-13 10:18:49,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:18:49" (1/1) ... [2024-09-13 10:18:49,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:18:49" (1/1) ... [2024-09-13 10:18:49,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:18:49" (1/1) ... [2024-09-13 10:18:49,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:18:49" (1/1) ... [2024-09-13 10:18:49,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:18:49" (1/1) ... [2024-09-13 10:18:49,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 10:18:49,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 10:18:49,160 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 10:18:49,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 10:18:49,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:18:49" (1/1) ... [2024-09-13 10:18:49,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:18:49,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:18:49,188 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:18:49,194 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:18:49,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 10:18:49,237 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 10:18:49,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 10:18:49,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 10:18:49,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 10:18:49,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 10:18:49,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 10:18:49,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 10:18:49,292 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 10:18:49,293 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 10:18:49,563 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 10:18:49,594 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-09-13 10:18:49,594 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 10:18:49,621 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 10:18:49,621 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 10:18:49,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:18:49 BoogieIcfgContainer [2024-09-13 10:18:49,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 10:18:49,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 10:18:49,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 10:18:49,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 10:18:49,627 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:18:47" (1/4) ... [2024-09-13 10:18:49,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d64e140 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 10:18:49, skipping insertion in model container [2024-09-13 10:18:49,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 10:18:48" (2/4) ... [2024-09-13 10:18:49,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d64e140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:18:49, skipping insertion in model container [2024-09-13 10:18:49,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:18:49" (3/4) ... [2024-09-13 10:18:49,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d64e140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:18:49, skipping insertion in model container [2024-09-13 10:18:49,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:18:49" (4/4) ... [2024-09-13 10:18:49,630 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound2.c [2024-09-13 10:18:49,641 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 10:18:49,641 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-09-13 10:18:49,676 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 10:18:49,685 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;@49cc6692, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 10:18:49,687 INFO L337 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-09-13 10:18:49,691 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:18:49,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 10:18:49,697 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:49,697 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 10:18:49,698 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:18:49,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:49,704 INFO L85 PathProgramCache]: Analyzing trace with hash 134843102, now seen corresponding path program 1 times [2024-09-13 10:18:49,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:49,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672421924] [2024-09-13 10:18:49,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:49,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:49,820 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:18:49,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:18:49,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672421924] [2024-09-13 10:18:49,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672421924] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:18:49,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:18:49,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:18:49,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687633057] [2024-09-13 10:18:49,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:18:49,826 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 10:18:49,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:49,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 10:18:49,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 10:18:49,846 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:18:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:49,866 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-09-13 10:18:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 10:18:49,868 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:18:49,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:49,873 INFO L225 Difference]: With dead ends: 43 [2024-09-13 10:18:49,873 INFO L226 Difference]: Without dead ends: 41 [2024-09-13 10:18:49,875 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:18:49,877 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:18:49,877 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:18:49,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-13 10:18:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-13 10:18:49,901 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:18:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2024-09-13 10:18:49,904 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 5 [2024-09-13 10:18:49,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:49,905 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2024-09-13 10:18:49,905 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:18:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2024-09-13 10:18:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 10:18:49,905 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:49,905 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 10:18:49,906 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 10:18:49,906 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:18:49,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:49,909 INFO L85 PathProgramCache]: Analyzing trace with hash 134843164, now seen corresponding path program 1 times [2024-09-13 10:18:49,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:49,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884897609] [2024-09-13 10:18:49,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:49,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:49,953 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:18:49,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:18:49,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884897609] [2024-09-13 10:18:49,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884897609] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:18:49,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:18:49,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:18:49,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079208272] [2024-09-13 10:18:49,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:18:49,955 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:18:49,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:49,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:18:49,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:18:49,956 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:18:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:49,997 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-09-13 10:18:49,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:18:49,998 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:18:49,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:49,999 INFO L225 Difference]: With dead ends: 40 [2024-09-13 10:18:50,000 INFO L226 Difference]: Without dead ends: 40 [2024-09-13 10:18:50,000 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:18:50,001 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:18:50,002 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:18:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-13 10:18:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-09-13 10:18:50,008 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:18:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2024-09-13 10:18:50,011 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 5 [2024-09-13 10:18:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:50,011 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-09-13 10:18:50,012 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:18:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-09-13 10:18:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 10:18:50,012 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:50,013 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:18:50,013 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 10:18:50,013 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:18:50,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:50,014 INFO L85 PathProgramCache]: Analyzing trace with hash 363565673, now seen corresponding path program 1 times [2024-09-13 10:18:50,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:50,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747340769] [2024-09-13 10:18:50,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:50,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:50,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:18:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:50,484 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:18:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:50,492 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:18:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-13 10:18:50,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:18:50,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747340769] [2024-09-13 10:18:50,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747340769] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:18:50,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231157352] [2024-09-13 10:18:50,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:50,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:18:50,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:18:50,524 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:18:50,535 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:18:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:50,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-13 10:18:50,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:18:50,771 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:18:50,771 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 10:18:50,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231157352] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:18:50,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 10:18:50,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2024-09-13 10:18:50,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472492371] [2024-09-13 10:18:50,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:18:50,773 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 10:18:50,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:50,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 10:18:50,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-13 10:18:50,776 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:18:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:50,924 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2024-09-13 10:18:50,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 10:18:50,925 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:18:50,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:50,926 INFO L225 Difference]: With dead ends: 51 [2024-09-13 10:18:50,926 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 10:18:50,926 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-13 10:18:50,927 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:18:50,927 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 95 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:18:50,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 10:18:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-13 10:18:50,937 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:18:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-09-13 10:18:50,940 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 19 [2024-09-13 10:18:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:50,941 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-09-13 10:18:50,941 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:18:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-09-13 10:18:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 10:18:50,942 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:50,943 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:18:50,956 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-13 10:18:51,143 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:18:51,144 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:18:51,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:51,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1764960997, now seen corresponding path program 1 times [2024-09-13 10:18:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:51,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684910875] [2024-09-13 10:18:51,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:51,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:51,175 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:18:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:51,178 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:18:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:51,180 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:18:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:51,187 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:18:51,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:18:51,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684910875] [2024-09-13 10:18:51,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684910875] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:18:51,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:18:51,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:18:51,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556271700] [2024-09-13 10:18:51,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:18:51,190 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:18:51,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:51,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:18:51,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:18:51,191 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:18:51,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:51,204 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2024-09-13 10:18:51,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:18:51,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 10:18:51,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:51,205 INFO L225 Difference]: With dead ends: 49 [2024-09-13 10:18:51,205 INFO L226 Difference]: Without dead ends: 49 [2024-09-13 10:18:51,206 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:18:51,206 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:18:51,207 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:18:51,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-13 10:18:51,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-13 10:18:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 10:18:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-09-13 10:18:51,215 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 24 [2024-09-13 10:18:51,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:51,216 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-09-13 10:18:51,216 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:18:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-09-13 10:18:51,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 10:18:51,217 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:51,217 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:18:51,218 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 10:18:51,218 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:18:51,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1764960836, now seen corresponding path program 1 times [2024-09-13 10:18:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:51,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624804999] [2024-09-13 10:18:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:51,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:51,244 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:18:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:51,249 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:18:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:51,251 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:18:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:51,254 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:18:51,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:18:51,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624804999] [2024-09-13 10:18:51,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624804999] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:18:51,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:18:51,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:18:51,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494952766] [2024-09-13 10:18:51,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:18:51,258 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:18:51,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:51,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:18:51,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:18:51,259 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:18:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:51,289 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2024-09-13 10:18:51,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:18:51,291 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:18:51,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:51,292 INFO L225 Difference]: With dead ends: 48 [2024-09-13 10:18:51,292 INFO L226 Difference]: Without dead ends: 48 [2024-09-13 10:18:51,292 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:18:51,292 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:18:51,293 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:18:51,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-13 10:18:51,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-09-13 10:18:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 10:18:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2024-09-13 10:18:51,303 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 24 [2024-09-13 10:18:51,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:51,303 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2024-09-13 10:18:51,303 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:18:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2024-09-13 10:18:51,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 10:18:51,304 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:51,304 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:18:51,304 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 10:18:51,304 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:18:51,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:51,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1154352905, now seen corresponding path program 1 times [2024-09-13 10:18:51,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:51,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123491137] [2024-09-13 10:18:51,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:51,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:51,621 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:18:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:51,623 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:18:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:51,625 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:18:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:51,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:18:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:51,633 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:18:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:51,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:18:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:51,650 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:18:51,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:18:51,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123491137] [2024-09-13 10:18:51,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123491137] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:18:51,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143876712] [2024-09-13 10:18:51,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:51,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:18:51,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:18:51,655 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:18:51,659 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:18:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:51,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-13 10:18:51,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:18:51,883 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:18:51,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:18:52,264 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:18:52,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143876712] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:18:52,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:18:52,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-09-13 10:18:52,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124289000] [2024-09-13 10:18:52,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:18:52,266 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 10:18:52,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:52,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 10:18:52,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:18:52,268 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-13 10:18:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:52,474 INFO L93 Difference]: Finished difference Result 73 states and 106 transitions. [2024-09-13 10:18:52,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 10:18:52,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 37 [2024-09-13 10:18:52,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:52,476 INFO L225 Difference]: With dead ends: 73 [2024-09-13 10:18:52,476 INFO L226 Difference]: Without dead ends: 73 [2024-09-13 10:18:52,476 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-09-13 10:18:52,476 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:18:52,477 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 113 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:18:52,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-13 10:18:52,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2024-09-13 10:18:52,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-13 10:18:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2024-09-13 10:18:52,486 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 37 [2024-09-13 10:18:52,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:52,486 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2024-09-13 10:18:52,486 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-13 10:18:52,486 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2024-09-13 10:18:52,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-13 10:18:52,487 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:52,487 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:18:52,500 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-13 10:18:52,688 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:18:52,689 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:18:52,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:52,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1515868503, now seen corresponding path program 1 times [2024-09-13 10:18:52,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:52,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332053965] [2024-09-13 10:18:52,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:52,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:18:52,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236282204] [2024-09-13 10:18:52,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:52,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:18:52,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:18:52,721 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:18:52,723 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:18:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:52,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 10:18:52,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:18:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-13 10:18:52,827 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 10:18:52,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:18:52,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332053965] [2024-09-13 10:18:52,828 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:18:52,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236282204] [2024-09-13 10:18:52,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236282204] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:18:52,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:18:52,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:18:52,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526181109] [2024-09-13 10:18:52,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:18:52,829 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:18:52,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:52,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:18:52,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:18:52,831 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-13 10:18:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:52,859 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2024-09-13 10:18:52,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:18:52,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2024-09-13 10:18:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:52,860 INFO L225 Difference]: With dead ends: 68 [2024-09-13 10:18:52,861 INFO L226 Difference]: Without dead ends: 68 [2024-09-13 10:18:52,861 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:18:52,861 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:18:52,862 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 62 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:18:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-13 10:18:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2024-09-13 10:18:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 41 states have internal predecessors, (50), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-13 10:18:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2024-09-13 10:18:52,866 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 94 transitions. Word has length 50 [2024-09-13 10:18:52,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:52,866 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 94 transitions. [2024-09-13 10:18:52,866 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-13 10:18:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 94 transitions. [2024-09-13 10:18:52,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-13 10:18:52,867 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:52,867 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:18:52,879 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:18:53,068 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:18:53,068 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:18:53,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:53,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2018739730, now seen corresponding path program 1 times [2024-09-13 10:18:53,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:53,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001072676] [2024-09-13 10:18:53,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:53,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,113 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:18:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,115 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:18:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,116 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:18:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,117 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:18:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,120 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:18:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,122 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:18:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:18:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,127 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:18:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,129 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 10:18:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,132 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:18:53,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:18:53,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001072676] [2024-09-13 10:18:53,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001072676] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:18:53,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:18:53,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:18:53,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913332614] [2024-09-13 10:18:53,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:18:53,133 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:18:53,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:53,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:18:53,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:18:53,134 INFO L87 Difference]: Start difference. First operand 65 states and 94 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-13 10:18:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:53,164 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. [2024-09-13 10:18:53,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:18:53,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2024-09-13 10:18:53,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:53,166 INFO L225 Difference]: With dead ends: 72 [2024-09-13 10:18:53,166 INFO L226 Difference]: Without dead ends: 65 [2024-09-13 10:18:53,166 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:18:53,167 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:18:53,167 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:18:53,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-09-13 10:18:53,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-09-13 10:18:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-13 10:18:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-09-13 10:18:53,171 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 55 [2024-09-13 10:18:53,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:53,171 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-09-13 10:18:53,171 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-13 10:18:53,171 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-09-13 10:18:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-13 10:18:53,172 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:53,172 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:18:53,173 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 10:18:53,173 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:18:53,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:53,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1118640133, now seen corresponding path program 2 times [2024-09-13 10:18:53,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:53,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398831284] [2024-09-13 10:18:53,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:53,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,621 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:18:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,623 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:18:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,625 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:18:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:18:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:18:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:18:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:18:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,656 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:18:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 10:18:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-13 10:18:53,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:18:53,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398831284] [2024-09-13 10:18:53,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398831284] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:18:53,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823355695] [2024-09-13 10:18:53,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 10:18:53,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:18:53,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:18:53,672 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:18:53,677 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:18:53,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 10:18:53,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 10:18:53,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-13 10:18:53,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:18:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-13 10:18:54,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:18:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-13 10:18:54,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823355695] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:18:54,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:18:54,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2024-09-13 10:18:54,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267177249] [2024-09-13 10:18:54,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:18:54,558 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-13 10:18:54,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:54,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-13 10:18:54,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-09-13 10:18:54,560 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-09-13 10:18:54,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:54,863 INFO L93 Difference]: Finished difference Result 87 states and 132 transitions. [2024-09-13 10:18:54,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 10:18:54,864 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 55 [2024-09-13 10:18:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:54,866 INFO L225 Difference]: With dead ends: 87 [2024-09-13 10:18:54,866 INFO L226 Difference]: Without dead ends: 87 [2024-09-13 10:18:54,866 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-09-13 10:18:54,866 INFO L434 NwaCegarLoop]: 53 mSDtfsCounter, 25 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:18:54,867 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 217 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:18:54,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-13 10:18:54,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2024-09-13 10:18:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 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:18:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2024-09-13 10:18:54,875 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 55 [2024-09-13 10:18:54,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:54,875 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2024-09-13 10:18:54,875 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-09-13 10:18:54,876 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2024-09-13 10:18:54,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-13 10:18:54,879 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:54,879 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:18:54,901 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:18:55,080 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:18:55,080 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:18:55,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:55,081 INFO L85 PathProgramCache]: Analyzing trace with hash -550970448, now seen corresponding path program 1 times [2024-09-13 10:18:55,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:55,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85653061] [2024-09-13 10:18:55,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:55,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:56,113 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:18:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:56,116 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:18:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:56,117 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:18:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:56,118 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:18:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:56,122 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:18:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:56,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:18:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:56,130 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:18:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:56,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:18:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:56,177 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 10:18:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:56,200 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 10:18:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:56,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 10:18:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-13 10:18:56,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:18:56,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85653061] [2024-09-13 10:18:56,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85653061] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:18:56,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347508559] [2024-09-13 10:18:56,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:56,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:18:56,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:18:56,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:18:56,238 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 10:18:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:56,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-13 10:18:56,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:18:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-13 10:18:56,870 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:18:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-13 10:18:57,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347508559] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:18:57,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:18:57,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-09-13 10:18:57,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817187034] [2024-09-13 10:18:57,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:18:57,650 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-13 10:18:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:57,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-13 10:18:57,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-09-13 10:18:57,651 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 10 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 10 states have call predecessors, (27), 10 states have call successors, (27) [2024-09-13 10:18:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:57,924 INFO L93 Difference]: Finished difference Result 83 states and 122 transitions. [2024-09-13 10:18:57,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 10:18:57,925 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 10 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 10 states have call predecessors, (27), 10 states have call successors, (27) Word has length 69 [2024-09-13 10:18:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:57,926 INFO L225 Difference]: With dead ends: 83 [2024-09-13 10:18:57,926 INFO L226 Difference]: Without dead ends: 83 [2024-09-13 10:18:57,926 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 147 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-09-13 10:18:57,926 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:18:57,927 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 216 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:18:57,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-13 10:18:57,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2024-09-13 10:18:57,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 46 states have internal predecessors, (51), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-09-13 10:18:57,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 103 transitions. [2024-09-13 10:18:57,932 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 103 transitions. Word has length 69 [2024-09-13 10:18:57,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:57,932 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 103 transitions. [2024-09-13 10:18:57,933 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 10 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 10 states have call predecessors, (27), 10 states have call successors, (27) [2024-09-13 10:18:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2024-09-13 10:18:57,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-13 10:18:57,934 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:57,934 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:18:57,952 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-13 10:18:58,135 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-13 10:18:58,135 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:18:58,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:58,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1381978582, now seen corresponding path program 1 times [2024-09-13 10:18:58,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:58,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363710309] [2024-09-13 10:18:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:58,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:18:58,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [977541499] [2024-09-13 10:18:58,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:58,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:18:58,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:18:58,204 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:18:58,206 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-13 10:18:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:58,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-13 10:18:58,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:18:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-09-13 10:18:58,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:18:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-09-13 10:18:58,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:18:58,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363710309] [2024-09-13 10:18:58,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:18:58,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977541499] [2024-09-13 10:18:58,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977541499] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:18:58,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 10:18:58,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-09-13 10:18:58,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939306186] [2024-09-13 10:18:58,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 10:18:58,512 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 10:18:58,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:58,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 10:18:58,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:18:58,512 INFO L87 Difference]: Start difference. First operand 74 states and 103 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-09-13 10:18:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:58,584 INFO L93 Difference]: Finished difference Result 82 states and 117 transitions. [2024-09-13 10:18:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 10:18:58,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 82 [2024-09-13 10:18:58,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:58,585 INFO L225 Difference]: With dead ends: 82 [2024-09-13 10:18:58,585 INFO L226 Difference]: Without dead ends: 82 [2024-09-13 10:18:58,586 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:18:58,586 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:18:58,586 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 106 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:18:58,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-09-13 10:18:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 67. [2024-09-13 10:18:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-13 10:18:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2024-09-13 10:18:58,592 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 82 [2024-09-13 10:18:58,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:58,592 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2024-09-13 10:18:58,592 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-09-13 10:18:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2024-09-13 10:18:58,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-13 10:18:58,593 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:58,593 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:18:58,609 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-13 10:18:58,797 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-13 10:18:58,798 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:18:58,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:58,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1551961905, now seen corresponding path program 1 times [2024-09-13 10:18:58,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:58,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142249767] [2024-09-13 10:18:58,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:59,129 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:18:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:59,130 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:18:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:59,132 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:18:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:59,137 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:18:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:59,143 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:18:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:59,146 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:18:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:59,148 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:18:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:59,153 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:18:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:59,157 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 10:18:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:59,162 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 10:18:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:59,167 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 10:18:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:59,173 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-13 10:18:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:59,177 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-13 10:18:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:59,179 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 10:18:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 10:18:59,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:18:59,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142249767] [2024-09-13 10:18:59,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142249767] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:18:59,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282345197] [2024-09-13 10:18:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:59,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:18:59,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:18:59,184 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:18:59,185 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-13 10:18:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:18:59,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-13 10:18:59,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:18:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-09-13 10:18:59,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:18:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-09-13 10:18:59,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282345197] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 10:18:59,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 10:18:59,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5] total 10 [2024-09-13 10:18:59,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408461658] [2024-09-13 10:18:59,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:18:59,627 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:18:59,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:18:59,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:18:59,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-09-13 10:18:59,628 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-13 10:18:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:18:59,668 INFO L93 Difference]: Finished difference Result 66 states and 92 transitions. [2024-09-13 10:18:59,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:18:59,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 87 [2024-09-13 10:18:59,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:18:59,671 INFO L225 Difference]: With dead ends: 66 [2024-09-13 10:18:59,671 INFO L226 Difference]: Without dead ends: 53 [2024-09-13 10:18:59,671 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-09-13 10:18:59,672 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:18:59,672 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 49 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:18:59,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-13 10:18:59,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-13 10:18:59,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 10:18:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2024-09-13 10:18:59,677 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 87 [2024-09-13 10:18:59,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:18:59,677 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2024-09-13 10:18:59,677 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-13 10:18:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2024-09-13 10:18:59,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-13 10:18:59,678 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:18:59,678 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:18:59,697 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-13 10:18:59,878 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:18:59,879 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:18:59,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:18:59,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1137425730, now seen corresponding path program 2 times [2024-09-13 10:18:59,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:18:59,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151698807] [2024-09-13 10:18:59,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:18:59,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:18:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:01,237 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:01,240 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:01,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:01,243 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:19:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:01,256 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:19:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:01,272 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:19:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:01,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:19:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:01,292 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:19:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:01,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 10:19:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:01,314 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 10:19:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:01,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 10:19:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:01,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-13 10:19:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:01,348 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 10:19:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:01,360 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 10:19:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 10:19:01,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:01,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151698807] [2024-09-13 10:19:01,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151698807] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:19:01,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400705051] [2024-09-13 10:19:01,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 10:19:01,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:01,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:01,373 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:19:01,374 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-13 10:19:01,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 10:19:01,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 10:19:01,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-13 10:19:01,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:02,187 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 10:19:02,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:19:04,294 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 10:19:04,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400705051] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:19:04,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:19:04,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 20 [2024-09-13 10:19:04,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347975212] [2024-09-13 10:19:04,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:19:04,296 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 10:19:04,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:04,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 10:19:04,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2024-09-13 10:19:04,297 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 21 states, 20 states have (on average 2.55) internal successors, (51), 21 states have internal predecessors, (51), 10 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 10 states have call predecessors, (36), 10 states have call successors, (36) [2024-09-13 10:19:04,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:04,667 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2024-09-13 10:19:04,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 10:19:04,667 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 21 states have internal predecessors, (51), 10 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 10 states have call predecessors, (36), 10 states have call successors, (36) Word has length 87 [2024-09-13 10:19:04,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:04,668 INFO L225 Difference]: With dead ends: 52 [2024-09-13 10:19:04,668 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 10:19:04,668 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2024-09-13 10:19:04,669 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 21 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:04,669 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 243 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:19:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 10:19:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-13 10:19:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-13 10:19:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2024-09-13 10:19:04,671 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 87 [2024-09-13 10:19:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:04,672 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2024-09-13 10:19:04,672 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 21 states have internal predecessors, (51), 10 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 10 states have call predecessors, (36), 10 states have call successors, (36) [2024-09-13 10:19:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2024-09-13 10:19:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-09-13 10:19:04,673 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:19:04,673 INFO L216 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:04,685 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-13 10:19:04,873 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:04,874 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:19:04,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:19:04,874 INFO L85 PathProgramCache]: Analyzing trace with hash -436202355, now seen corresponding path program 1 times [2024-09-13 10:19:04,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:19:04,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707441224] [2024-09-13 10:19:04,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:04,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:19:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,763 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:19:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,765 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:19:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,766 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:19:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,767 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:19:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,770 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 10:19:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 10:19:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,775 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 10:19:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,780 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 10:19:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,786 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 10:19:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,791 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 10:19:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,800 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 10:19:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,810 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-13 10:19:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,819 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 10:19:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,828 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 10:19:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-09-13 10:19:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,843 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-13 10:19:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-09-13 10:19:05,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:19:05,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707441224] [2024-09-13 10:19:05,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707441224] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:19:05,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036999090] [2024-09-13 10:19:05,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:19:05,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:19:05,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:19:05,851 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:19:05,852 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-13 10:19:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:19:05,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-13 10:19:05,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:19:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-09-13 10:19:06,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:19:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-09-13 10:19:07,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036999090] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 10:19:07,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 10:19:07,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 10] total 20 [2024-09-13 10:19:07,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197864276] [2024-09-13 10:19:07,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:19:07,397 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:19:07,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:19:07,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:19:07,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-09-13 10:19:07,399 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-13 10:19:07,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:19:07,445 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2024-09-13 10:19:07,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:19:07,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2024-09-13 10:19:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:19:07,449 INFO L225 Difference]: With dead ends: 48 [2024-09-13 10:19:07,449 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 10:19:07,449 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 219 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-09-13 10:19:07,449 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:19:07,450 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 64 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:19:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 10:19:07,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 10:19:07,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:19:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 10:19:07,454 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2024-09-13 10:19:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:19:07,454 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 10:19:07,454 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-13 10:19:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 10:19:07,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 10:19:07,456 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 12 remaining) [2024-09-13 10:19:07,457 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (10 of 12 remaining) [2024-09-13 10:19:07,457 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (9 of 12 remaining) [2024-09-13 10:19:07,457 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (8 of 12 remaining) [2024-09-13 10:19:07,457 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 12 remaining) [2024-09-13 10:19:07,458 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (6 of 12 remaining) [2024-09-13 10:19:07,458 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION (5 of 12 remaining) [2024-09-13 10:19:07,458 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION (4 of 12 remaining) [2024-09-13 10:19:07,458 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION (3 of 12 remaining) [2024-09-13 10:19:07,460 INFO L785 garLoopResultBuilder]: Registering result SAFE for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 12 remaining) [2024-09-13 10:19:07,460 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2024-09-13 10:19:07,460 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 12 remaining) [2024-09-13 10:19:07,487 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-13 10:19:07,661 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-13 10:19:07,664 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:19:07,665 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 10:19:07,666 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-13 10:19:07,666 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-13 10:19:07,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 10:19:07 BoogieIcfgContainer [2024-09-13 10:19:07,667 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 10:19:07,667 INFO L158 Benchmark]: Toolchain (without parser) took 18853.63ms. Allocated memory was 155.2MB in the beginning and 589.3MB in the end (delta: 434.1MB). Free memory was 126.7MB in the beginning and 449.9MB in the end (delta: -323.2MB). Peak memory consumption was 113.0MB. Max. memory is 16.1GB. [2024-09-13 10:19:07,668 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:19:07,668 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 155.2MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:19:07,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.89ms. Allocated memory is still 155.2MB. Free memory was 126.7MB in the beginning and 110.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 10:19:07,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.07ms. Allocated memory is still 155.2MB. Free memory was 110.9MB in the beginning and 107.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-13 10:19:07,668 INFO L158 Benchmark]: Boogie Preprocessor took 33.41ms. Allocated memory is still 155.2MB. Free memory was 107.3MB in the beginning and 105.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 10:19:07,668 INFO L158 Benchmark]: RCFGBuilder took 462.40ms. Allocated memory is still 155.2MB. Free memory was 104.7MB in the beginning and 74.5MB in the end (delta: 30.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-09-13 10:19:07,668 INFO L158 Benchmark]: TraceAbstraction took 18043.94ms. Allocated memory was 155.2MB in the beginning and 589.3MB in the end (delta: 434.1MB). Free memory was 73.8MB in the beginning and 449.9MB in the end (delta: -376.1MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2024-09-13 10:19:07,673 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.09ms. Allocated memory is still 155.2MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.89ms. Allocated memory is still 155.2MB. Free memory was 126.7MB in the beginning and 110.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.07ms. Allocated memory is still 155.2MB. Free memory was 110.9MB in the beginning and 107.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.41ms. Allocated memory is still 155.2MB. Free memory was 107.3MB in the beginning and 105.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 462.40ms. Allocated memory is still 155.2MB. Free memory was 104.7MB in the beginning and 74.5MB in the end (delta: 30.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18043.94ms. Allocated memory was 155.2MB in the beginning and 589.3MB in the end (delta: 434.1MB). Free memory was 73.8MB in the beginning and 449.9MB in the end (delta: -376.1MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 46]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 11]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 14]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 43 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 18.0s, OverallIterations: 14, TraceHistogramMax: 13, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 197 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 1558 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1000 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1127 IncrementalHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 558 mSDtfsCounter, 1127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1331 GetRequests, 1212 SyntacticMatches, 21 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=10, InterpolantAutomatonStates: 79, 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, 14 MinimizatonAttempts, 63 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 1287 NumberOfCodeBlocks, 1287 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1645 ConstructedInterpolants, 0 QuantifiedInterpolants, 18699 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1384 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 3639/3818 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 10:19:07,720 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE