./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/hh2012-ex3.i --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/hh2012-ex3.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/loop-lit/hh2012-ex3.i ../results/automizer-verification-files/SV-COMP24_unreach-call/hh2012-ex3.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 05:16:15,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 05:16:16,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 05:16:16,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 05:16:16,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 05:16:16,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 05:16:16,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 05:16:16,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 05:16:16,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 05:16:16,100 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 05:16:16,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 05:16:16,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 05:16:16,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 05:16:16,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 05:16:16,104 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 05:16:16,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 05:16:16,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 05:16:16,105 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 05:16:16,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 05:16:16,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 05:16:16,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 05:16:16,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 05:16:16,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 05:16:16,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 05:16:16,110 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 05:16:16,110 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 05:16:16,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 05:16:16,111 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 05:16:16,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 05:16:16,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 05:16:16,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 05:16:16,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 05:16:16,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:16:16,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 05:16:16,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 05:16:16,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 05:16:16,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 05:16:16,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 05:16:16,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 05:16:16,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 05:16:16,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 05:16:16,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 05:16:16,115 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-13 05:16:16,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 05:16:16,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 05:16:16,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 05:16:16,351 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 05:16:16,352 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 05:16:16,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/hh2012-ex3.yml/witness-2.1.yml [2024-09-13 05:16:16,400 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 05:16:16,401 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 05:16:16,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-09-13 05:16:17,799 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 05:16:17,977 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 05:16:17,978 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-09-13 05:16:17,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/fa53fc49d/1b36c3d2be2c4f98b01f2bd435d001c0/FLAGcbb79e174 [2024-09-13 05:16:18,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/fa53fc49d/1b36c3d2be2c4f98b01f2bd435d001c0 [2024-09-13 05:16:18,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 05:16:18,380 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 05:16:18,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 05:16:18,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 05:16:18,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 05:16:18,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:16:16" (1/2) ... [2024-09-13 05:16:18,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9ba6ba and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:16:18, skipping insertion in model container [2024-09-13 05:16:18,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:16:16" (1/2) ... [2024-09-13 05:16:18,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@344c7618 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:16:18, skipping insertion in model container [2024-09-13 05:16:18,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:16:18" (2/2) ... [2024-09-13 05:16:18,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9ba6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:16:18, skipping insertion in model container [2024-09-13 05:16:18,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:16:18" (2/2) ... [2024-09-13 05:16:18,402 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 05:16:18,403 INFO L1541 ArrayList]: Loop invariant at [L18-L25] ((((j == 0) && (0 <= i)) && (i <= 3)) || ((((i <= ((long long) j + 3)) && (1 <= j)) && (j <= i)) && (j <= 4))) [2024-09-13 05:16:18,403 INFO L1541 ArrayList]: Loop invariant at [L16-L31] ((i <= 4) && (0 <= i)) [2024-09-13 05:16:18,403 INFO L1541 ArrayList]: Function contract at [L13]: requires (\old(cond) != 0), ensures (\old(cond) != 0) [2024-09-13 05:16:18,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 05:16:18,564 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/loop-lit/hh2012-ex3.i[799,812] [2024-09-13 05:16:18,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:16:18,597 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global [2024-09-13 05:16:18,627 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/loop-lit/hh2012-ex3.i[799,812] Start Parsing Local Start Parsing Local [2024-09-13 05:16:18,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:16:18,649 INFO L204 MainTranslator]: Completed translation [2024-09-13 05:16:18,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:16:18 WrapperNode [2024-09-13 05:16:18,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 05:16:18,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 05:16:18,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 05:16:18,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 05:16:18,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:16:18" (1/1) ... [2024-09-13 05:16:18,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:16:18" (1/1) ... [2024-09-13 05:16:18,680 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2024-09-13 05:16:18,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 05:16:18,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 05:16:18,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 05:16:18,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 05:16:18,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:16:18" (1/1) ... [2024-09-13 05:16:18,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:16:18" (1/1) ... [2024-09-13 05:16:18,696 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:16:18" (1/1) ... [2024-09-13 05:16:18,713 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure __VERIFIER_assert is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-13 05:16:18,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:16:18" (1/1) ... [2024-09-13 05:16:18,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:16:18" (1/1) ... [2024-09-13 05:16:18,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:16:18" (1/1) ... [2024-09-13 05:16:18,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:16:18" (1/1) ... [2024-09-13 05:16:18,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:16:18" (1/1) ... [2024-09-13 05:16:18,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:16:18" (1/1) ... [2024-09-13 05:16:18,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 05:16:18,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 05:16:18,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 05:16:18,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 05:16:18,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:16:18" (1/1) ... [2024-09-13 05:16:18,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:16:18,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:16:18,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 05:16:18,757 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 05:16:18,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 05:16:18,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 05:16:18,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 05:16:18,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 05:16:18,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 05:16:18,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 05:16:18,847 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 05:16:18,849 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 05:16:18,972 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 05:16:18,996 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-09-13 05:16:18,997 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 05:16:19,018 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 05:16:19,018 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 05:16:19,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:16:19 BoogieIcfgContainer [2024-09-13 05:16:19,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 05:16:19,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 05:16:19,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 05:16:19,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 05:16:19,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:16:16" (1/4) ... [2024-09-13 05:16:19,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ca80d5 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 05:16:19, skipping insertion in model container [2024-09-13 05:16:19,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 05:16:18" (2/4) ... [2024-09-13 05:16:19,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ca80d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:16:19, skipping insertion in model container [2024-09-13 05:16:19,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:16:18" (3/4) ... [2024-09-13 05:16:19,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ca80d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:16:19, skipping insertion in model container [2024-09-13 05:16:19,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:16:19" (4/4) ... [2024-09-13 05:16:19,034 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex3.i [2024-09-13 05:16:19,048 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 05:16:19,048 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-09-13 05:16:19,096 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 05:16:19,103 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;@5a99cc5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 05:16:19,104 INFO L337 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-09-13 05:16:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 05:16:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-09-13 05:16:19,125 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:16:19,125 INFO L216 NwaCegarLoop]: trace histogram [1, 1] [2024-09-13 05:16:19,126 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:16:19,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:16:19,146 INFO L85 PathProgramCache]: Analyzing trace with hash 3507, now seen corresponding path program 1 times [2024-09-13 05:16:19,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:16:19,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651477472] [2024-09-13 05:16:19,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:16:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:16:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:16:19,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:16:19,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651477472] [2024-09-13 05:16:19,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651477472] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:16:19,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:16:19,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-13 05:16:19,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572458285] [2024-09-13 05:16:19,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:16:19,331 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:16:19,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:16:19,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:16:19,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:16:19,361 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:16:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:16:19,416 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2024-09-13 05:16:19,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:16:19,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-09-13 05:16:19,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:16:19,426 INFO L225 Difference]: With dead ends: 44 [2024-09-13 05:16:19,426 INFO L226 Difference]: Without dead ends: 42 [2024-09-13 05:16:19,429 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:16:19,434 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:16:19,435 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 56 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:16:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-13 05:16:19,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2024-09-13 05:16:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.263157894736842) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 05:16:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-09-13 05:16:19,467 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 2 [2024-09-13 05:16:19,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:16:19,467 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-09-13 05:16:19,468 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:16:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-09-13 05:16:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-09-13 05:16:19,468 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:16:19,468 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-09-13 05:16:19,468 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 05:16:19,469 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:16:19,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:16:19,469 INFO L85 PathProgramCache]: Analyzing trace with hash 3371606, now seen corresponding path program 1 times [2024-09-13 05:16:19,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:16:19,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922638590] [2024-09-13 05:16:19,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:16:19,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:16:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:16:19,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:16:19,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922638590] [2024-09-13 05:16:19,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922638590] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:16:19,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:16:19,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:16:19,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970747518] [2024-09-13 05:16:19,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:16:19,591 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:16:19,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:16:19,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:16:19,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:16:19,592 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 05:16:19,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:16:19,640 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-09-13 05:16:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:16:19,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-09-13 05:16:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:16:19,641 INFO L225 Difference]: With dead ends: 35 [2024-09-13 05:16:19,641 INFO L226 Difference]: Without dead ends: 35 [2024-09-13 05:16:19,642 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:16:19,643 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:16:19,643 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:16:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-13 05:16:19,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-13 05:16:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 05:16:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-09-13 05:16:19,654 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 4 [2024-09-13 05:16:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:16:19,655 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-09-13 05:16:19,655 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 05:16:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-09-13 05:16:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-09-13 05:16:19,656 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:16:19,656 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-09-13 05:16:19,656 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 05:16:19,657 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:16:19,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:16:19,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1054852199, now seen corresponding path program 1 times [2024-09-13 05:16:19,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:16:19,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86256250] [2024-09-13 05:16:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:16:19,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:16:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:16:19,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:16:19,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86256250] [2024-09-13 05:16:19,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86256250] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:16:19,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:16:19,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:16:19,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125484244] [2024-09-13 05:16:19,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:16:19,765 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:16:19,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:16:19,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:16:19,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:16:19,767 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:16:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:16:19,842 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2024-09-13 05:16:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:16:19,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-09-13 05:16:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:16:19,843 INFO L225 Difference]: With dead ends: 35 [2024-09-13 05:16:19,843 INFO L226 Difference]: Without dead ends: 35 [2024-09-13 05:16:19,844 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:16:19,845 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:16:19,845 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 54 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:16:19,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-13 05:16:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-09-13 05:16:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 05:16:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-09-13 05:16:19,850 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 6 [2024-09-13 05:16:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:16:19,850 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-09-13 05:16:19,850 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:16:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-09-13 05:16:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-13 05:16:19,851 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:16:19,851 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:16:19,852 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 05:16:19,852 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:16:19,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:16:19,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1175088790, now seen corresponding path program 1 times [2024-09-13 05:16:19,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:16:19,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199160034] [2024-09-13 05:16:19,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:16:19,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:16:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:16:19,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:16:19,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199160034] [2024-09-13 05:16:19,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199160034] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:16:19,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:16:19,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:16:19,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649082785] [2024-09-13 05:16:19,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:16:19,913 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:16:19,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:16:19,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:16:19,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:16:19,915 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:16:19,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:16:19,925 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2024-09-13 05:16:19,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:16:19,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-09-13 05:16:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:16:19,929 INFO L225 Difference]: With dead ends: 32 [2024-09-13 05:16:19,929 INFO L226 Difference]: Without dead ends: 32 [2024-09-13 05:16:19,929 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:16:19,930 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:16:19,930 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:16:19,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-13 05:16:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-13 05:16:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 05:16:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-09-13 05:16:19,937 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 9 [2024-09-13 05:16:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:16:19,938 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-09-13 05:16:19,938 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:16:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-09-13 05:16:19,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-13 05:16:19,938 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:16:19,938 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:16:19,939 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 05:16:19,939 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:16:19,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:16:19,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1175088951, now seen corresponding path program 1 times [2024-09-13 05:16:19,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:16:19,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493513547] [2024-09-13 05:16:19,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:16:19,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:16:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:16:19,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:16:19,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493513547] [2024-09-13 05:16:19,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493513547] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:16:19,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:16:19,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:16:19,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007286760] [2024-09-13 05:16:19,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:16:19,983 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:16:19,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:16:19,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:16:19,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:16:19,984 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:16:20,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:16:20,027 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-09-13 05:16:20,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:16:20,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-09-13 05:16:20,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:16:20,029 INFO L225 Difference]: With dead ends: 31 [2024-09-13 05:16:20,031 INFO L226 Difference]: Without dead ends: 31 [2024-09-13 05:16:20,031 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:16:20,032 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:16:20,032 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:16:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-13 05:16:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-13 05:16:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 05:16:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2024-09-13 05:16:20,042 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 9 [2024-09-13 05:16:20,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:16:20,042 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2024-09-13 05:16:20,043 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:16:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2024-09-13 05:16:20,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-13 05:16:20,043 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:16:20,043 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:16:20,043 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 05:16:20,043 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:16:20,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:16:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash -315915824, now seen corresponding path program 1 times [2024-09-13 05:16:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:16:20,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440498525] [2024-09-13 05:16:20,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:16:20,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:16:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:20,166 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 05:16:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:16:20,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:16:20,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440498525] [2024-09-13 05:16:20,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440498525] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:16:20,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:16:20,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 05:16:20,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517810212] [2024-09-13 05:16:20,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:16:20,178 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:16:20,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:16:20,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:16:20,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:16:20,180 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 05:16:20,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:16:20,253 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-09-13 05:16:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:16:20,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-13 05:16:20,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:16:20,256 INFO L225 Difference]: With dead ends: 30 [2024-09-13 05:16:20,256 INFO L226 Difference]: Without dead ends: 30 [2024-09-13 05:16:20,256 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:16:20,258 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:16:20,259 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 39 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:16:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-13 05:16:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-09-13 05:16:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 05:16:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-09-13 05:16:20,265 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 11 [2024-09-13 05:16:20,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:16:20,266 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-09-13 05:16:20,266 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 05:16:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-09-13 05:16:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 05:16:20,266 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:16:20,266 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:16:20,267 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 05:16:20,267 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:16:20,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:16:20,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1628866105, now seen corresponding path program 1 times [2024-09-13 05:16:20,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:16:20,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334972502] [2024-09-13 05:16:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:16:20,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:16:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:20,355 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 05:16:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:20,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 05:16:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:16:20,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:16:20,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334972502] [2024-09-13 05:16:20,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334972502] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:16:20,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:16:20,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 05:16:20,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152158912] [2024-09-13 05:16:20,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:16:20,380 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:16:20,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:16:20,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:16:20,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:16:20,381 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:16:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:16:20,444 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2024-09-13 05:16:20,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:16:20,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-13 05:16:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:16:20,446 INFO L225 Difference]: With dead ends: 41 [2024-09-13 05:16:20,447 INFO L226 Difference]: Without dead ends: 41 [2024-09-13 05:16:20,447 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:16:20,447 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:16:20,448 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:16:20,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-13 05:16:20,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-09-13 05:16:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-13 05:16:20,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2024-09-13 05:16:20,455 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 16 [2024-09-13 05:16:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:16:20,456 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2024-09-13 05:16:20,456 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:16:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2024-09-13 05:16:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-13 05:16:20,457 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:16:20,458 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:16:20,458 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 05:16:20,458 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:16:20,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:16:20,459 INFO L85 PathProgramCache]: Analyzing trace with hash 781900720, now seen corresponding path program 1 times [2024-09-13 05:16:20,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:16:20,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605416314] [2024-09-13 05:16:20,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:16:20,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:16:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:20,548 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 05:16:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:20,556 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 05:16:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:20,562 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 05:16:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 05:16:20,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:16:20,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605416314] [2024-09-13 05:16:20,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605416314] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:16:20,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:16:20,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:16:20,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057073484] [2024-09-13 05:16:20,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:16:20,572 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:16:20,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:16:20,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:16:20,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:16:20,573 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 05:16:20,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:16:20,613 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2024-09-13 05:16:20,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:16:20,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-09-13 05:16:20,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:16:20,615 INFO L225 Difference]: With dead ends: 51 [2024-09-13 05:16:20,616 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 05:16:20,616 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:16:20,616 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:16:20,619 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:16:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 05:16:20,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-13 05:16:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-13 05:16:20,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 81 transitions. [2024-09-13 05:16:20,629 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 81 transitions. Word has length 21 [2024-09-13 05:16:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:16:20,630 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 81 transitions. [2024-09-13 05:16:20,630 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 05:16:20,630 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 81 transitions. [2024-09-13 05:16:20,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-13 05:16:20,630 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:16:20,630 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:16:20,631 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 05:16:20,631 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:16:20,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:16:20,631 INFO L85 PathProgramCache]: Analyzing trace with hash 177494214, now seen corresponding path program 1 times [2024-09-13 05:16:20,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:16:20,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460725553] [2024-09-13 05:16:20,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:16:20,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:16:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:20,720 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 05:16:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:20,726 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 05:16:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:20,731 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 05:16:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:20,736 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:16:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 05:16:20,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:16:20,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460725553] [2024-09-13 05:16:20,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460725553] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:16:20,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534898343] [2024-09-13 05:16:20,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:16:20,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:16:20,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:16:20,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:16:20,749 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 05:16:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:20,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-13 05:16:20,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:16:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 05:16:20,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:16:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 05:16:21,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534898343] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:16:21,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:16:21,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-13 05:16:21,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858541711] [2024-09-13 05:16:21,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:16:21,040 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 05:16:21,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:16:21,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 05:16:21,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-13 05:16:21,041 INFO L87 Difference]: Start difference. First operand 51 states and 81 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-13 05:16:21,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:16:21,160 INFO L93 Difference]: Finished difference Result 59 states and 91 transitions. [2024-09-13 05:16:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 05:16:21,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 26 [2024-09-13 05:16:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:16:21,161 INFO L225 Difference]: With dead ends: 59 [2024-09-13 05:16:21,162 INFO L226 Difference]: Without dead ends: 59 [2024-09-13 05:16:21,162 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-09-13 05:16:21,164 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:16:21,165 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 74 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:16:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-13 05:16:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2024-09-13 05:16:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-09-13 05:16:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 90 transitions. [2024-09-13 05:16:21,177 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 90 transitions. Word has length 26 [2024-09-13 05:16:21,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:16:21,178 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 90 transitions. [2024-09-13 05:16:21,178 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-13 05:16:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 90 transitions. [2024-09-13 05:16:21,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-09-13 05:16:21,180 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:16:21,181 INFO L216 NwaCegarLoop]: trace histogram [16, 16, 16, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:16:21,199 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 05:16:21,381 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:16:21,382 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:16:21,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:16:21,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1814981713, now seen corresponding path program 1 times [2024-09-13 05:16:21,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:16:21,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142274906] [2024-09-13 05:16:21,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:16:21,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:16:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,511 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 05:16:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,516 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 05:16:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,520 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 05:16:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:16:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,528 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-13 05:16:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,532 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-13 05:16:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,536 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-13 05:16:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-13 05:16:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,549 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 05:16:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,554 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-13 05:16:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-13 05:16:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,562 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-13 05:16:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,568 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-13 05:16:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,575 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-13 05:16:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 05:16:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,585 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-13 05:16:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-13 05:16:21,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:16:21,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142274906] [2024-09-13 05:16:21,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142274906] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:16:21,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721758305] [2024-09-13 05:16:21,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:16:21,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:16:21,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:16:21,599 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:16:21,601 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 05:16:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:21,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 05:16:21,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:16:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 193 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-09-13 05:16:21,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:16:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-13 05:16:21,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721758305] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:16:21,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:16:21,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-09-13 05:16:21,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648509217] [2024-09-13 05:16:21,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:16:21,868 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 05:16:21,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:16:21,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 05:16:21,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-13 05:16:21,869 INFO L87 Difference]: Start difference. First operand 58 states and 90 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-09-13 05:16:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:16:21,934 INFO L93 Difference]: Finished difference Result 76 states and 124 transitions. [2024-09-13 05:16:21,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 05:16:21,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 93 [2024-09-13 05:16:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:16:21,937 INFO L225 Difference]: With dead ends: 76 [2024-09-13 05:16:21,937 INFO L226 Difference]: Without dead ends: 76 [2024-09-13 05:16:21,937 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 213 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-13 05:16:21,938 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:16:21,938 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:16:21,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-13 05:16:21,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-09-13 05:16:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-09-13 05:16:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 124 transitions. [2024-09-13 05:16:21,951 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 124 transitions. Word has length 93 [2024-09-13 05:16:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:16:21,951 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 124 transitions. [2024-09-13 05:16:21,952 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-09-13 05:16:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 124 transitions. [2024-09-13 05:16:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-13 05:16:21,958 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:16:21,958 INFO L216 NwaCegarLoop]: trace histogram [20, 20, 20, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:16:21,976 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 05:16:22,159 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-13 05:16:22,159 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:16:22,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:16:22,160 INFO L85 PathProgramCache]: Analyzing trace with hash -743486657, now seen corresponding path program 2 times [2024-09-13 05:16:22,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:16:22,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683008246] [2024-09-13 05:16:22,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:16:22,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:16:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 05:16:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,388 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 05:16:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,391 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 05:16:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,395 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:16:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-13 05:16:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-13 05:16:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,404 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-13 05:16:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,407 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-13 05:16:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,411 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 05:16:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-13 05:16:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,419 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-13 05:16:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,431 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-13 05:16:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,434 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-13 05:16:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,438 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-13 05:16:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,441 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 05:16:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,445 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-13 05:16:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-13 05:16:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-13 05:16:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-09-13 05:16:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,457 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-09-13 05:16:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-09-13 05:16:22,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:16:22,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683008246] [2024-09-13 05:16:22,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683008246] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:16:22,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429686166] [2024-09-13 05:16:22,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 05:16:22,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:16:22,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:16:22,463 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:16:22,465 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 05:16:22,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 05:16:22,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:16:22,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-13 05:16:22,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:16:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-09-13 05:16:22,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:16:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-09-13 05:16:23,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429686166] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:16:23,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:16:23,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2024-09-13 05:16:23,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924266994] [2024-09-13 05:16:23,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:16:23,338 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-13 05:16:23,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:16:23,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-13 05:16:23,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2024-09-13 05:16:23,342 INFO L87 Difference]: Start difference. First operand 76 states and 124 transitions. Second operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 15 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2024-09-13 05:16:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:16:23,830 INFO L93 Difference]: Finished difference Result 118 states and 200 transitions. [2024-09-13 05:16:23,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-13 05:16:23,831 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 15 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) Word has length 115 [2024-09-13 05:16:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:16:23,832 INFO L225 Difference]: With dead ends: 118 [2024-09-13 05:16:23,832 INFO L226 Difference]: Without dead ends: 118 [2024-09-13 05:16:23,833 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2024-09-13 05:16:23,833 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:16:23,833 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 196 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 05:16:23,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-09-13 05:16:23,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 95. [2024-09-13 05:16:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-09-13 05:16:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 153 transitions. [2024-09-13 05:16:23,853 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 153 transitions. Word has length 115 [2024-09-13 05:16:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:16:23,853 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 153 transitions. [2024-09-13 05:16:23,853 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 15 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2024-09-13 05:16:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 153 transitions. [2024-09-13 05:16:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-09-13 05:16:23,857 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:16:23,857 INFO L216 NwaCegarLoop]: trace histogram [20, 20, 20, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:16:23,875 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 05:16:24,057 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-13 05:16:24,058 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:16:24,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:16:24,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1526104862, now seen corresponding path program 1 times [2024-09-13 05:16:24,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:16:24,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40253991] [2024-09-13 05:16:24,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:16:24,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:16:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,121 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 05:16:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,123 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 05:16:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 05:16:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:16:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,127 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-13 05:16:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,130 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-13 05:16:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,133 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-13 05:16:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-13 05:16:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,136 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 05:16:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,137 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-13 05:16:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,143 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-13 05:16:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,147 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-13 05:16:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,149 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-13 05:16:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,150 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-13 05:16:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 05:16:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,154 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-13 05:16:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,156 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-13 05:16:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,159 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-13 05:16:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,161 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-09-13 05:16:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,163 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-09-13 05:16:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-09-13 05:16:24,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:16:24,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40253991] [2024-09-13 05:16:24,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40253991] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:16:24,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:16:24,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:16:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522777032] [2024-09-13 05:16:24,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:16:24,166 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:16:24,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:16:24,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:16:24,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:16:24,166 INFO L87 Difference]: Start difference. First operand 95 states and 153 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-13 05:16:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:16:24,202 INFO L93 Difference]: Finished difference Result 95 states and 151 transitions. [2024-09-13 05:16:24,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:16:24,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 117 [2024-09-13 05:16:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:16:24,204 INFO L225 Difference]: With dead ends: 95 [2024-09-13 05:16:24,204 INFO L226 Difference]: Without dead ends: 95 [2024-09-13 05:16:24,204 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:16:24,205 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:16:24,205 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 31 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:16:24,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-13 05:16:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-09-13 05:16:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-09-13 05:16:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 151 transitions. [2024-09-13 05:16:24,216 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 151 transitions. Word has length 117 [2024-09-13 05:16:24,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:16:24,217 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 151 transitions. [2024-09-13 05:16:24,217 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-13 05:16:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 151 transitions. [2024-09-13 05:16:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-09-13 05:16:24,221 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:16:24,221 INFO L216 NwaCegarLoop]: trace histogram [24, 24, 24, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:16:24,221 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-13 05:16:24,221 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:16:24,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:16:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1309061714, now seen corresponding path program 2 times [2024-09-13 05:16:24,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:16:24,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779673699] [2024-09-13 05:16:24,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:16:24,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:16:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 05:16:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 05:16:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,521 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 05:16:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:16:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-13 05:16:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,528 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-13 05:16:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-13 05:16:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,532 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-13 05:16:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,535 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 05:16:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,537 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-13 05:16:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,540 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-13 05:16:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-13 05:16:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,544 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-13 05:16:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,546 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-13 05:16:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,549 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 05:16:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,551 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-13 05:16:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,553 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-13 05:16:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,555 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-13 05:16:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,558 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-09-13 05:16:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,560 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-09-13 05:16:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,562 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-09-13 05:16:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,565 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-09-13 05:16:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,568 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-09-13 05:16:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,571 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-09-13 05:16:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-09-13 05:16:24,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:16:24,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779673699] [2024-09-13 05:16:24,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779673699] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:16:24,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437429529] [2024-09-13 05:16:24,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 05:16:24,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:16:24,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:16:24,577 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:16:24,578 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 05:16:24,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 05:16:24,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:16:24,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-13 05:16:24,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:16:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-09-13 05:16:24,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:16:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1148 trivial. 0 not checked. [2024-09-13 05:16:25,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437429529] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:16:25,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:16:25,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 6] total 20 [2024-09-13 05:16:25,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623973734] [2024-09-13 05:16:25,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:16:25,198 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 05:16:25,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:16:25,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 05:16:25,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2024-09-13 05:16:25,200 INFO L87 Difference]: Start difference. First operand 95 states and 151 transitions. Second operand has 21 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 12 states have call predecessors, (56), 12 states have call successors, (56) [2024-09-13 05:16:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:16:25,546 INFO L93 Difference]: Finished difference Result 140 states and 225 transitions. [2024-09-13 05:16:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-13 05:16:25,547 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 12 states have call predecessors, (56), 12 states have call successors, (56) Word has length 139 [2024-09-13 05:16:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:16:25,548 INFO L225 Difference]: With dead ends: 140 [2024-09-13 05:16:25,549 INFO L226 Difference]: Without dead ends: 140 [2024-09-13 05:16:25,550 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2024-09-13 05:16:25,550 INFO L434 NwaCegarLoop]: 53 mSDtfsCounter, 16 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:16:25,550 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 275 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 05:16:25,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-09-13 05:16:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-09-13 05:16:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-09-13 05:16:25,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 224 transitions. [2024-09-13 05:16:25,567 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 224 transitions. Word has length 139 [2024-09-13 05:16:25,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:16:25,568 INFO L474 AbstractCegarLoop]: Abstraction has 139 states and 224 transitions. [2024-09-13 05:16:25,568 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 12 states have call predecessors, (56), 12 states have call successors, (56) [2024-09-13 05:16:25,568 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 224 transitions. [2024-09-13 05:16:25,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-09-13 05:16:25,576 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:16:25,576 INFO L216 NwaCegarLoop]: trace histogram [64, 64, 64, 16, 13, 13, 13, 13, 13, 13, 13, 13, 13, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2024-09-13 05:16:25,593 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 05:16:25,776 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:16:25,777 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:16:25,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:16:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash 362318034, now seen corresponding path program 3 times [2024-09-13 05:16:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:16:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883189154] [2024-09-13 05:16:25,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:16:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:16:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,865 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 05:16:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,869 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 05:16:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,871 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 05:16:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,874 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:16:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,876 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-13 05:16:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,878 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-13 05:16:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,880 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-13 05:16:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,883 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-13 05:16:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,885 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 05:16:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,887 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-13 05:16:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,889 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-13 05:16:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,891 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-13 05:16:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,893 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-13 05:16:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-13 05:16:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,898 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 05:16:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-13 05:16:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,902 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-13 05:16:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,904 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-13 05:16:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,906 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-09-13 05:16:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,908 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-09-13 05:16:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,911 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-09-13 05:16:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,913 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-09-13 05:16:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-09-13 05:16:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,919 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-09-13 05:16:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,924 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-09-13 05:16:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,927 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-09-13 05:16:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,928 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-09-13 05:16:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,931 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-09-13 05:16:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,933 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-09-13 05:16:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,936 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-09-13 05:16:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,938 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-09-13 05:16:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,941 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-09-13 05:16:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,943 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-09-13 05:16:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,944 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-09-13 05:16:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-09-13 05:16:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,948 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-09-13 05:16:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,963 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-09-13 05:16:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,965 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-09-13 05:16:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-09-13 05:16:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-09-13 05:16:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,973 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-09-13 05:16:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,975 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-09-13 05:16:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,977 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-09-13 05:16:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,979 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-09-13 05:16:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,981 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-09-13 05:16:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,983 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-09-13 05:16:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-09-13 05:16:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,987 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-09-13 05:16:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,989 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-09-13 05:16:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-09-13 05:16:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,993 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-09-13 05:16:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-09-13 05:16:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,997 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-09-13 05:16:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:26,999 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-09-13 05:16:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:27,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-09-13 05:16:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:27,003 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-09-13 05:16:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:27,005 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2024-09-13 05:16:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:27,007 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-09-13 05:16:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:27,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-09-13 05:16:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:27,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2024-09-13 05:16:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:27,013 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2024-09-13 05:16:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:27,016 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2024-09-13 05:16:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:27,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2024-09-13 05:16:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:27,021 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-09-13 05:16:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:16:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8659 backedges. 24 proven. 520 refuted. 0 times theorem prover too weak. 8115 trivial. 0 not checked. [2024-09-13 05:16:27,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:16:27,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883189154] [2024-09-13 05:16:27,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883189154] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:16:27,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904425648] [2024-09-13 05:16:27,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 05:16:27,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:16:27,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:16:27,029 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:16:27,030 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 05:16:27,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-13 05:16:27,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:16:27,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-13 05:16:27,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:16:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8659 backedges. 96 proven. 1 refuted. 0 times theorem prover too weak. 8562 trivial. 0 not checked. [2024-09-13 05:16:27,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:16:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8659 backedges. 96 proven. 1 refuted. 0 times theorem prover too weak. 8562 trivial. 0 not checked. [2024-09-13 05:16:27,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904425648] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:16:27,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:16:27,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4, 4] total 21 [2024-09-13 05:16:27,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454049834] [2024-09-13 05:16:27,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:16:27,536 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-13 05:16:27,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:16:27,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-13 05:16:27,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-09-13 05:16:27,539 INFO L87 Difference]: Start difference. First operand 139 states and 224 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 13 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 13 states have call predecessors, (56), 13 states have call successors, (56) [2024-09-13 05:16:28,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:16:28,491 INFO L93 Difference]: Finished difference Result 159 states and 251 transitions. [2024-09-13 05:16:28,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-13 05:16:28,492 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 13 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 13 states have call predecessors, (56), 13 states have call successors, (56) Word has length 365 [2024-09-13 05:16:28,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:16:28,493 INFO L225 Difference]: With dead ends: 159 [2024-09-13 05:16:28,493 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 05:16:28,493 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 859 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=1319, Unknown=0, NotChecked=0, Total=1560 [2024-09-13 05:16:28,494 INFO L434 NwaCegarLoop]: 130 mSDtfsCounter, 66 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-13 05:16:28,494 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1054 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-13 05:16:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 05:16:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 05:16:28,495 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 05:16:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 05:16:28,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 365 [2024-09-13 05:16:28,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:16:28,495 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 05:16:28,496 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 13 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 13 states have call predecessors, (56), 13 states have call successors, (56) [2024-09-13 05:16:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 05:16:28,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 05:16:28,498 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 12 remaining) [2024-09-13 05:16:28,499 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 12 remaining) [2024-09-13 05:16:28,499 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (9 of 12 remaining) [2024-09-13 05:16:28,499 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (8 of 12 remaining) [2024-09-13 05:16:28,499 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION (7 of 12 remaining) [2024-09-13 05:16:28,499 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (6 of 12 remaining) [2024-09-13 05:16:28,499 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION (5 of 12 remaining) [2024-09-13 05:16:28,499 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION (4 of 12 remaining) [2024-09-13 05:16:28,499 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION (3 of 12 remaining) [2024-09-13 05:16:28,499 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION (2 of 12 remaining) [2024-09-13 05:16:28,500 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2024-09-13 05:16:28,500 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 12 remaining) [2024-09-13 05:16:28,516 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 05:16:28,700 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-13 05:16:28,703 INFO L408 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:16:28,705 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 05:16:28,707 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-13 05:16:28,707 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-13 05:16:28,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 05:16:28 BoogieIcfgContainer [2024-09-13 05:16:28,708 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 05:16:28,708 INFO L158 Benchmark]: Toolchain (without parser) took 10328.97ms. Allocated memory was 153.1MB in the beginning and 230.7MB in the end (delta: 77.6MB). Free memory was 97.4MB in the beginning and 158.8MB in the end (delta: -61.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-09-13 05:16:28,709 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 153.1MB. Free memory was 116.7MB in the beginning and 116.6MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:16:28,709 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 153.1MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:16:28,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.18ms. Allocated memory is still 153.1MB. Free memory was 97.4MB in the beginning and 83.6MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 05:16:28,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.52ms. Allocated memory is still 153.1MB. Free memory was 83.6MB in the beginning and 82.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:16:28,710 INFO L158 Benchmark]: Boogie Preprocessor took 44.31ms. Allocated memory is still 153.1MB. Free memory was 81.9MB in the beginning and 80.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 05:16:28,710 INFO L158 Benchmark]: RCFGBuilder took 291.70ms. Allocated memory is still 153.1MB. Free memory was 80.6MB in the beginning and 67.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 05:16:28,710 INFO L158 Benchmark]: TraceAbstraction took 9684.31ms. Allocated memory was 153.1MB in the beginning and 230.7MB in the end (delta: 77.6MB). Free memory was 66.8MB in the beginning and 158.8MB in the end (delta: -92.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:16:28,711 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.21ms. Allocated memory is still 153.1MB. Free memory was 116.7MB in the beginning and 116.6MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 153.1MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.18ms. Allocated memory is still 153.1MB. Free memory was 97.4MB in the beginning and 83.6MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.52ms. Allocated memory is still 153.1MB. Free memory was 83.6MB in the beginning and 82.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.31ms. Allocated memory is still 153.1MB. Free memory was 81.9MB in the beginning and 80.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 291.70ms. Allocated memory is still 153.1MB. Free memory was 80.6MB in the beginning and 67.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9684.31ms. Allocated memory was 153.1MB in the beginning and 230.7MB in the end (delta: 77.6MB). Free memory was 66.8MB in the beginning and 158.8MB in the end (delta: -92.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 18]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: 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: 13]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 14, TraceHistogramMax: 64, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 2080 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1576 mSDsCounter, 409 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2394 IncrementalHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 409 mSolverCounterUnsat, 504 mSDtfsCounter, 2394 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1884 GetRequests, 1755 SyntacticMatches, 5 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=13, InterpolantAutomatonStates: 116, 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, 39 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1671 NumberOfCodeBlocks, 1327 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2385 ConstructedInterpolants, 0 QuantifiedInterpolants, 4798 SizeOfPredicates, 0 NumberOfNonLiveVariables, 898 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 24 InterpolantComputations, 9 PerfectInterpolantSequences, 33441/34355 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 05:16:28,738 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE