./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/bh2017-ex1-poly.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f1d7dc9d 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/bh2017-ex1-poly.i ../results/automizer-verification-files/SV-COMP24_unreach-call/bh2017-ex1-poly.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-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 13:30:55,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 13:30:55,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 13:30:55,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 13:30:55,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 13:30:55,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 13:30:55,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 13:30:55,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 13:30:55,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 13:30:55,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 13:30:55,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 13:30:55,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 13:30:55,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 13:30:55,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 13:30:55,551 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 13:30:55,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 13:30:55,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 13:30:55,554 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 13:30:55,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 13:30:55,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 13:30:55,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 13:30:55,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 13:30:55,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 13:30:55,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 13:30:55,556 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 13:30:55,556 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 13:30:55,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 13:30:55,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 13:30:55,559 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 13:30:55,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 13:30:55,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 13:30:55,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 13:30:55,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:30:55,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 13:30:55,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 13:30:55,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 13:30:55,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 13:30:55,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 13:30:55,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 13:30:55,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 13:30:55,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 13:30:55,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 13:30:55,564 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-20 13:30:55,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 13:30:55,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 13:30:55,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 13:30:55,853 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-20 13:30:55,853 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-20 13:30:55,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/bh2017-ex1-poly.yml/witness-2.1.yml [2024-09-20 13:30:55,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 13:30:55,909 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 13:30:55,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2024-09-20 13:30:57,354 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 13:30:57,526 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 13:30:57,527 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2024-09-20 13:30:57,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/8a0a4e329/f2a4211c9707482e8f99fcbad5059e13/FLAGf63b12aa5 [2024-09-20 13:30:57,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/8a0a4e329/f2a4211c9707482e8f99fcbad5059e13 [2024-09-20 13:30:57,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 13:30:57,547 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-20 13:30:57,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 13:30:57,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 13:30:57,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 13:30:57,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:30:55" (1/2) ... [2024-09-20 13:30:57,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e4e03 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:57, skipping insertion in model container [2024-09-20 13:30:57,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:30:55" (1/2) ... [2024-09-20 13:30:57,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@239eb42a and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:57, skipping insertion in model container [2024-09-20 13:30:57,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:30:57" (2/2) ... [2024-09-20 13:30:57,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e4e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:57, skipping insertion in model container [2024-09-20 13:30:57,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:30:57" (2/2) ... [2024-09-20 13:30:57,567 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-20 13:30:57,567 INFO L1541 ArrayList]: Loop invariant at [L18-L25] ((((((j <= 4) && (2 <= j)) && (j == ((long long) i * 2))) || ((((((long long) i * 2) <= ((long long) j + 6)) && (j <= 4)) && (2 <= j)) && (((long long) j + 2) <= ((long long) i * 2)))) || (((j == 0) && (1 <= i)) && (i <= 3))) || ((j == 0) && (i == 0))) [2024-09-20 13:30:57,568 INFO L1541 ArrayList]: Loop invariant at [L16-L31] ((0 < i) || (i == 0)) [2024-09-20 13:30:57,568 INFO L1541 ArrayList]: Function contract at [L13]: requires (\old(cond) != 0), ensures (\old(cond) != 0) [2024-09-20 13:30:57,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 13:30:57,734 WARN L248 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/bh2017-ex1-poly.i[804,817] [2024-09-20 13:30:57,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:30:57,763 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global [2024-09-20 13:30:57,801 WARN L248 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/bh2017-ex1-poly.i[804,817] Start Parsing Local Start Parsing Local [2024-09-20 13:30:57,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:30:57,830 INFO L204 MainTranslator]: Completed translation [2024-09-20 13:30:57,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:57 WrapperNode [2024-09-20 13:30:57,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 13:30:57,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 13:30:57,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 13:30:57,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 13:30:57,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:57" (1/1) ... [2024-09-20 13:30:57,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:57" (1/1) ... [2024-09-20 13:30:57,862 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2024-09-20 13:30:57,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 13:30:57,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 13:30:57,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 13:30:57,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 13:30:57,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:57" (1/1) ... [2024-09-20 13:30:57,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:57" (1/1) ... [2024-09-20 13:30:57,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:57" (1/1) ... [2024-09-20 13:30:57,887 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-20 13:30:57,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:57" (1/1) ... [2024-09-20 13:30:57,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:57" (1/1) ... [2024-09-20 13:30:57,890 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:57" (1/1) ... [2024-09-20 13:30:57,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:57" (1/1) ... [2024-09-20 13:30:57,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:57" (1/1) ... [2024-09-20 13:30:57,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:57" (1/1) ... [2024-09-20 13:30:57,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 13:30:57,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 13:30:57,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 13:30:57,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 13:30:57,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:57" (1/1) ... [2024-09-20 13:30:57,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:30:57,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:30:57,922 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-20 13:30:57,925 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-20 13:30:57,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 13:30:57,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-20 13:30:57,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 13:30:57,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 13:30:57,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 13:30:57,963 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 13:30:58,009 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 13:30:58,010 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 13:30:58,131 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-20 13:30:58,151 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-09-20 13:30:58,152 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 13:30:58,173 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 13:30:58,173 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-20 13:30:58,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:30:58 BoogieIcfgContainer [2024-09-20 13:30:58,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 13:30:58,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 13:30:58,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 13:30:58,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 13:30:58,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:30:55" (1/4) ... [2024-09-20 13:30:58,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfa0c9a and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.09 01:30:58, skipping insertion in model container [2024-09-20 13:30:58,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:30:57" (2/4) ... [2024-09-20 13:30:58,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfa0c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:30:58, skipping insertion in model container [2024-09-20 13:30:58,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:57" (3/4) ... [2024-09-20 13:30:58,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfa0c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:30:58, skipping insertion in model container [2024-09-20 13:30:58,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:30:58" (4/4) ... [2024-09-20 13:30:58,187 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex1-poly.i [2024-09-20 13:30:58,205 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 13:30:58,205 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-09-20 13:30:58,249 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 13:30:58,255 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;@4b54debc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 13:30:58,255 INFO L337 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-09-20 13:30:58,258 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-20 13:30:58,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-09-20 13:30:58,263 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:58,263 INFO L216 NwaCegarLoop]: trace histogram [1, 1] [2024-09-20 13:30:58,263 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-20 13:30:58,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:58,267 INFO L85 PathProgramCache]: Analyzing trace with hash 3507, now seen corresponding path program 1 times [2024-09-20 13:30:58,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:58,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967893460] [2024-09-20 13:30:58,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:58,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:58,429 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-20 13:30:58,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:58,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967893460] [2024-09-20 13:30:58,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967893460] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:58,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:58,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-20 13:30:58,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400731132] [2024-09-20 13:30:58,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:58,444 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:30:58,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:58,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:30:58,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:30:58,508 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-20 13:30:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:58,602 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2024-09-20 13:30:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:30:58,604 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-20 13:30:58,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:58,611 INFO L225 Difference]: With dead ends: 44 [2024-09-20 13:30:58,611 INFO L226 Difference]: Without dead ends: 42 [2024-09-20 13:30:58,613 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-20 13:30:58,616 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.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:58,617 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.1s Time] [2024-09-20 13:30:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-20 13:30:58,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2024-09-20 13:30:58,643 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-20 13:30:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-09-20 13:30:58,645 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 2 [2024-09-20 13:30:58,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:58,645 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-09-20 13:30:58,645 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-20 13:30:58,645 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-09-20 13:30:58,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-09-20 13:30:58,646 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:58,646 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-09-20 13:30:58,646 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 13:30:58,646 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-20 13:30:58,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:58,647 INFO L85 PathProgramCache]: Analyzing trace with hash 3371606, now seen corresponding path program 1 times [2024-09-20 13:30:58,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:58,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412669972] [2024-09-20 13:30:58,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:58,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:58,711 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-20 13:30:58,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:58,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412669972] [2024-09-20 13:30:58,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412669972] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:58,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:58,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 13:30:58,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183836896] [2024-09-20 13:30:58,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:58,714 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 13:30:58,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:58,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 13:30:58,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:30:58,715 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-20 13:30:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:58,762 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-09-20 13:30:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 13:30:58,763 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-20 13:30:58,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:58,764 INFO L225 Difference]: With dead ends: 35 [2024-09-20 13:30:58,764 INFO L226 Difference]: Without dead ends: 35 [2024-09-20 13:30:58,764 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-20 13:30:58,765 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-20 13:30:58,765 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-20 13:30:58,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-20 13:30:58,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-20 13:30:58,773 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-20 13:30:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-09-20 13:30:58,775 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 4 [2024-09-20 13:30:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:58,775 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-09-20 13:30:58,775 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-20 13:30:58,775 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-09-20 13:30:58,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-09-20 13:30:58,776 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:58,776 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-09-20 13:30:58,776 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 13:30:58,776 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-20 13:30:58,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:58,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1054852199, now seen corresponding path program 1 times [2024-09-20 13:30:58,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:58,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498470084] [2024-09-20 13:30:58,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:58,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:58,920 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-20 13:30:58,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498470084] [2024-09-20 13:30:58,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498470084] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:58,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:58,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:30:58,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011110440] [2024-09-20 13:30:58,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:58,922 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 13:30:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:58,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 13:30:58,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:30:58,923 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-20 13:30:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:59,011 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2024-09-20 13:30:59,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 13:30:59,013 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-20 13:30:59,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:59,013 INFO L225 Difference]: With dead ends: 35 [2024-09-20 13:30:59,014 INFO L226 Difference]: Without dead ends: 35 [2024-09-20 13:30:59,014 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-20 13:30:59,015 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-20 13:30:59,015 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-20 13:30:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-20 13:30:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-09-20 13:30:59,025 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-20 13:30:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-09-20 13:30:59,027 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 6 [2024-09-20 13:30:59,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:59,027 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-09-20 13:30:59,028 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-20 13:30:59,028 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-09-20 13:30:59,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-20 13:30:59,028 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:59,028 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:59,028 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 13:30:59,029 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-20 13:30:59,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1175088790, now seen corresponding path program 1 times [2024-09-20 13:30:59,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:59,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982700974] [2024-09-20 13:30:59,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:59,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,080 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-20 13:30:59,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:59,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982700974] [2024-09-20 13:30:59,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982700974] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:59,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:59,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:30:59,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111342339] [2024-09-20 13:30:59,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:59,082 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:30:59,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:59,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:30:59,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:30:59,083 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-20 13:30:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:59,091 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2024-09-20 13:30:59,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:30:59,091 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-20 13:30:59,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:59,092 INFO L225 Difference]: With dead ends: 32 [2024-09-20 13:30:59,092 INFO L226 Difference]: Without dead ends: 32 [2024-09-20 13:30:59,092 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-20 13:30:59,093 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-20 13:30:59,094 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-20 13:30:59,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-20 13:30:59,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-20 13:30:59,097 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-20 13:30:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-09-20 13:30:59,098 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 9 [2024-09-20 13:30:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:59,099 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-09-20 13:30:59,099 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-20 13:30:59,099 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-09-20 13:30:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-20 13:30:59,099 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:59,100 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:59,100 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 13:30:59,100 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-20 13:30:59,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:59,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1175088951, now seen corresponding path program 1 times [2024-09-20 13:30:59,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:59,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673439299] [2024-09-20 13:30:59,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:59,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,130 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-20 13:30:59,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:59,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673439299] [2024-09-20 13:30:59,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673439299] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:59,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:59,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 13:30:59,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919874505] [2024-09-20 13:30:59,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:59,133 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:30:59,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:59,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:30:59,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:30:59,134 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-20 13:30:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:59,177 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-09-20 13:30:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:30:59,177 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-20 13:30:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:59,178 INFO L225 Difference]: With dead ends: 31 [2024-09-20 13:30:59,178 INFO L226 Difference]: Without dead ends: 31 [2024-09-20 13:30:59,178 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-20 13:30:59,179 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-20 13:30:59,180 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-20 13:30:59,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-20 13:30:59,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-20 13:30:59,183 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-20 13:30:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2024-09-20 13:30:59,184 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 9 [2024-09-20 13:30:59,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:59,184 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2024-09-20 13:30:59,184 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-20 13:30:59,184 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2024-09-20 13:30:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-20 13:30:59,185 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:59,185 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:59,185 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 13:30:59,185 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-20 13:30:59,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:59,186 INFO L85 PathProgramCache]: Analyzing trace with hash -315915824, now seen corresponding path program 1 times [2024-09-20 13:30:59,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:59,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014066234] [2024-09-20 13:30:59,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:59,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:30:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,298 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-20 13:30:59,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:59,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014066234] [2024-09-20 13:30:59,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014066234] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:59,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:59,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-20 13:30:59,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821654601] [2024-09-20 13:30:59,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:59,300 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 13:30:59,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:59,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 13:30:59,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:30:59,301 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-20 13:30:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:59,363 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-09-20 13:30:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 13:30:59,363 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-20 13:30:59,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:59,364 INFO L225 Difference]: With dead ends: 30 [2024-09-20 13:30:59,365 INFO L226 Difference]: Without dead ends: 30 [2024-09-20 13:30:59,365 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-20 13:30:59,366 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-20 13:30:59,369 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-20 13:30:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-20 13:30:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-09-20 13:30:59,375 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-20 13:30:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-09-20 13:30:59,375 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 11 [2024-09-20 13:30:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:59,376 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-09-20 13:30:59,376 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-20 13:30:59,376 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-09-20 13:30:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 13:30:59,379 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:59,379 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:59,379 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 13:30:59,379 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-20 13:30:59,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:59,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1628866105, now seen corresponding path program 1 times [2024-09-20 13:30:59,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:59,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849959407] [2024-09-20 13:30:59,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:59,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,475 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:30:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,484 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 13:30:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,494 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-20 13:30:59,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:59,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849959407] [2024-09-20 13:30:59,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849959407] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:59,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:59,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-20 13:30:59,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136681789] [2024-09-20 13:30:59,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:59,496 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 13:30:59,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:59,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 13:30:59,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:30:59,498 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-20 13:30:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:59,557 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2024-09-20 13:30:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 13:30:59,558 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-20 13:30:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:59,559 INFO L225 Difference]: With dead ends: 41 [2024-09-20 13:30:59,559 INFO L226 Difference]: Without dead ends: 41 [2024-09-20 13:30:59,559 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-20 13:30:59,560 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-20 13:30:59,560 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-20 13:30:59,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-20 13:30:59,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-09-20 13:30:59,565 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-20 13:30:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2024-09-20 13:30:59,568 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 16 [2024-09-20 13:30:59,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:59,568 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2024-09-20 13:30:59,568 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-20 13:30:59,568 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2024-09-20 13:30:59,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-20 13:30:59,569 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:59,579 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:59,579 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-20 13:30:59,580 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-20 13:30:59,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:59,580 INFO L85 PathProgramCache]: Analyzing trace with hash 781900720, now seen corresponding path program 1 times [2024-09-20 13:30:59,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:59,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546759065] [2024-09-20 13:30:59,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:59,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:30:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 13:30:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 13:30:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,675 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-20 13:30:59,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:59,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546759065] [2024-09-20 13:30:59,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546759065] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:59,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:59,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:30:59,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727663499] [2024-09-20 13:30:59,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:59,679 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 13:30:59,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:59,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 13:30:59,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:30:59,680 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-20 13:30:59,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:59,721 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2024-09-20 13:30:59,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 13:30:59,722 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-20 13:30:59,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:59,724 INFO L225 Difference]: With dead ends: 51 [2024-09-20 13:30:59,724 INFO L226 Difference]: Without dead ends: 51 [2024-09-20 13:30:59,724 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-20 13:30:59,726 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-20 13:30:59,727 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-20 13:30:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-20 13:30:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-20 13:30:59,734 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-20 13:30:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 81 transitions. [2024-09-20 13:30:59,735 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 81 transitions. Word has length 21 [2024-09-20 13:30:59,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:59,736 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 81 transitions. [2024-09-20 13:30:59,736 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-20 13:30:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 81 transitions. [2024-09-20 13:30:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-20 13:30:59,736 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:59,737 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:59,737 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-20 13:30:59,737 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-20 13:30:59,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:59,737 INFO L85 PathProgramCache]: Analyzing trace with hash 177494214, now seen corresponding path program 1 times [2024-09-20 13:30:59,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:59,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578080833] [2024-09-20 13:30:59,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:59,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,872 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:30:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,883 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 13:30:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,895 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 13:30:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,903 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 13:30:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,913 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-20 13:30:59,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:59,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578080833] [2024-09-20 13:30:59,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578080833] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:30:59,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654065123] [2024-09-20 13:30:59,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:59,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:30:59,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:30:59,919 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-20 13:30:59,921 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-20 13:30:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:59,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-20 13:30:59,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:31:00,071 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-20 13:31:00,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:31:00,219 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-20 13:31:00,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654065123] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:31:00,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 13:31:00,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-09-20 13:31:00,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588385376] [2024-09-20 13:31:00,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 13:31:00,220 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 13:31:00,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:31:00,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 13:31:00,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-20 13:31:00,220 INFO L87 Difference]: Start difference. First operand 51 states and 81 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-20 13:31:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:31:00,318 INFO L93 Difference]: Finished difference Result 53 states and 81 transitions. [2024-09-20 13:31:00,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 13:31:00,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-20 13:31:00,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:31:00,319 INFO L225 Difference]: With dead ends: 53 [2024-09-20 13:31:00,319 INFO L226 Difference]: Without dead ends: 53 [2024-09-20 13:31:00,320 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-20 13:31:00,320 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:31:00,320 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 74 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:31:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-20 13:31:00,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-09-20 13:31:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-20 13:31:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 80 transitions. [2024-09-20 13:31:00,330 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 80 transitions. Word has length 26 [2024-09-20 13:31:00,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:31:00,331 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 80 transitions. [2024-09-20 13:31:00,331 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-20 13:31:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 80 transitions. [2024-09-20 13:31:00,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-09-20 13:31:00,332 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:31:00,332 INFO L216 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:31:00,351 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-20 13:31:00,537 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-20 13:31:00,538 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-20 13:31:00,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:31:00,539 INFO L85 PathProgramCache]: Analyzing trace with hash -111816673, now seen corresponding path program 1 times [2024-09-20 13:31:00,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:31:00,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665835787] [2024-09-20 13:31:00,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:31:00,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:31:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:00,723 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:31:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:00,727 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 13:31:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:00,732 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 13:31:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:00,737 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 13:31:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:00,750 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-20 13:31:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:00,760 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-20 13:31:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:00,764 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-20 13:31:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:00,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-20 13:31:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:00,773 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 13:31:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:00,778 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-20 13:31:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:00,783 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 13:31:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:00,792 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 13:31:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-09-20 13:31:00,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:31:00,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665835787] [2024-09-20 13:31:00,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665835787] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:31:00,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231982707] [2024-09-20 13:31:00,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:31:00,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:31:00,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:31:00,811 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-20 13:31:00,813 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-20 13:31:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:00,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-20 13:31:00,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:31:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-09-20 13:31:01,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:31:01,483 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-09-20 13:31:01,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231982707] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:31:01,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 13:31:01,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2024-09-20 13:31:01,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957938494] [2024-09-20 13:31:01,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 13:31:01,486 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-20 13:31:01,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:31:01,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-20 13:31:01,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2024-09-20 13:31:01,487 INFO L87 Difference]: Start difference. First operand 52 states and 80 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) [2024-09-20 13:31:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:31:01,648 INFO L93 Difference]: Finished difference Result 49 states and 77 transitions. [2024-09-20 13:31:01,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-20 13:31:01,649 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) Word has length 71 [2024-09-20 13:31:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:31:01,654 INFO L225 Difference]: With dead ends: 49 [2024-09-20 13:31:01,654 INFO L226 Difference]: Without dead ends: 49 [2024-09-20 13:31:01,654 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2024-09-20 13:31:01,655 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:31:01,655 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:31:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-20 13:31:01,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-09-20 13:31:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-20 13:31:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 75 transitions. [2024-09-20 13:31:01,662 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 75 transitions. Word has length 71 [2024-09-20 13:31:01,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:31:01,662 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 75 transitions. [2024-09-20 13:31:01,662 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) [2024-09-20 13:31:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 75 transitions. [2024-09-20 13:31:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-20 13:31:01,668 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:31:01,668 INFO L216 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:31:01,685 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 13:31:01,868 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-20 13:31:01,869 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-20 13:31:01,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:31:01,869 INFO L85 PathProgramCache]: Analyzing trace with hash -81638974, now seen corresponding path program 1 times [2024-09-20 13:31:01,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:31:01,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076659750] [2024-09-20 13:31:01,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:31:01,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:31:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:01,981 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:31:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:01,984 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 13:31:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:01,986 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 13:31:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:01,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 13:31:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:01,990 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-20 13:31:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:01,992 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-20 13:31:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:01,994 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-20 13:31:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:01,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-20 13:31:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:01,998 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 13:31:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-20 13:31:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 13:31:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,004 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 13:31:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-09-20 13:31:02,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:31:02,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076659750] [2024-09-20 13:31:02,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076659750] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:31:02,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:31:02,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:31:02,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883058809] [2024-09-20 13:31:02,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:31:02,007 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 13:31:02,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:31:02,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 13:31:02,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:31:02,008 INFO L87 Difference]: Start difference. First operand 48 states and 75 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-20 13:31:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:31:02,046 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2024-09-20 13:31:02,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 13:31:02,047 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 73 [2024-09-20 13:31:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:31:02,048 INFO L225 Difference]: With dead ends: 48 [2024-09-20 13:31:02,048 INFO L226 Difference]: Without dead ends: 48 [2024-09-20 13:31:02,048 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-20 13:31:02,049 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:31:02,049 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 29 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:31:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-20 13:31:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-09-20 13:31:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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-20 13:31:02,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 74 transitions. [2024-09-20 13:31:02,054 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 74 transitions. Word has length 73 [2024-09-20 13:31:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:31:02,054 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 74 transitions. [2024-09-20 13:31:02,054 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-20 13:31:02,055 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 74 transitions. [2024-09-20 13:31:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-20 13:31:02,056 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:31:02,057 INFO L216 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:31:02,057 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-20 13:31:02,057 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-20 13:31:02,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:31:02,057 INFO L85 PathProgramCache]: Analyzing trace with hash 281123749, now seen corresponding path program 1 times [2024-09-20 13:31:02,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:31:02,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327682978] [2024-09-20 13:31:02,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:31:02,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:31:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,185 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:31:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,188 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 13:31:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,190 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 13:31:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,192 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 13:31:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,194 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-20 13:31:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,196 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-20 13:31:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,198 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-20 13:31:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-20 13:31:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,201 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 13:31:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-20 13:31:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,205 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 13:31:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,207 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 13:31:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-20 13:31:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,212 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-20 13:31:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-09-20 13:31:02,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:31:02,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327682978] [2024-09-20 13:31:02,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327682978] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:31:02,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:31:02,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:31:02,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451482750] [2024-09-20 13:31:02,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:31:02,217 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 13:31:02,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:31:02,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 13:31:02,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:31:02,217 INFO L87 Difference]: Start difference. First operand 48 states and 74 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-20 13:31:02,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:31:02,251 INFO L93 Difference]: Finished difference Result 46 states and 71 transitions. [2024-09-20 13:31:02,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 13:31:02,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 85 [2024-09-20 13:31:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:31:02,253 INFO L225 Difference]: With dead ends: 46 [2024-09-20 13:31:02,253 INFO L226 Difference]: Without dead ends: 46 [2024-09-20 13:31:02,253 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 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-20 13:31:02,254 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:31:02,254 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 40 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:31:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-20 13:31:02,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-09-20 13:31:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-20 13:31:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 65 transitions. [2024-09-20 13:31:02,259 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 65 transitions. Word has length 85 [2024-09-20 13:31:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:31:02,259 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 65 transitions. [2024-09-20 13:31:02,259 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-20 13:31:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 65 transitions. [2024-09-20 13:31:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-09-20 13:31:02,261 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:31:02,261 INFO L216 NwaCegarLoop]: trace histogram [16, 16, 16, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:31:02,261 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-20 13:31:02,261 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-20 13:31:02,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:31:02,262 INFO L85 PathProgramCache]: Analyzing trace with hash -207317198, now seen corresponding path program 2 times [2024-09-20 13:31:02,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:31:02,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397412149] [2024-09-20 13:31:02,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:31:02,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:31:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,552 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:31:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 13:31:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,561 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 13:31:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 13:31:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,569 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-20 13:31:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-20 13:31:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-20 13:31:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,579 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-20 13:31:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 13:31:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,592 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-20 13:31:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,597 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 13:31:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,602 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 13:31:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,605 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-20 13:31:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,611 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-20 13:31:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,615 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-09-20 13:31:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,618 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-09-20 13:31:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:31:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-20 13:31:02,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:31:02,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397412149] [2024-09-20 13:31:02,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397412149] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:31:02,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918280603] [2024-09-20 13:31:02,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 13:31:02,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:31:02,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:31:02,626 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-20 13:31:02,627 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-20 13:31:02,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 13:31:02,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 13:31:02,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-20 13:31:02,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:31:02,957 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-20 13:31:02,957 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:31:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-20 13:31:03,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918280603] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:31:03,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 13:31:03,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2024-09-20 13:31:03,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210679794] [2024-09-20 13:31:03,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 13:31:03,410 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-20 13:31:03,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:31:03,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-20 13:31:03,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2024-09-20 13:31:03,414 INFO L87 Difference]: Start difference. First operand 43 states and 65 transitions. Second operand has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 24 states have internal predecessors, (45), 12 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 12 states have call predecessors, (48), 12 states have call successors, (48) [2024-09-20 13:31:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:31:03,682 INFO L93 Difference]: Finished difference Result 57 states and 84 transitions. [2024-09-20 13:31:03,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-20 13:31:03,683 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 24 states have internal predecessors, (45), 12 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 12 states have call predecessors, (48), 12 states have call successors, (48) Word has length 95 [2024-09-20 13:31:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:31:03,684 INFO L225 Difference]: With dead ends: 57 [2024-09-20 13:31:03,684 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 13:31:03,685 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2024-09-20 13:31:03,687 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 13:31:03,687 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 180 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 13:31:03,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 13:31:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 13:31:03,688 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-20 13:31:03,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 13:31:03,688 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2024-09-20 13:31:03,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:31:03,688 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 13:31:03,689 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 24 states have internal predecessors, (45), 12 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 12 states have call predecessors, (48), 12 states have call successors, (48) [2024-09-20 13:31:03,689 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 13:31:03,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 13:31:03,691 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 12 remaining) [2024-09-20 13:31:03,691 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 12 remaining) [2024-09-20 13:31:03,692 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (9 of 12 remaining) [2024-09-20 13:31:03,692 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (8 of 12 remaining) [2024-09-20 13:31:03,692 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION (7 of 12 remaining) [2024-09-20 13:31:03,692 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (6 of 12 remaining) [2024-09-20 13:31:03,692 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION (5 of 12 remaining) [2024-09-20 13:31:03,694 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION (4 of 12 remaining) [2024-09-20 13:31:03,694 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION (3 of 12 remaining) [2024-09-20 13:31:03,694 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION (2 of 12 remaining) [2024-09-20 13:31:03,694 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2024-09-20 13:31:03,694 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 12 remaining) [2024-09-20 13:31:03,712 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-20 13:31:03,900 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-20 13:31:03,904 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:31:03,906 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 13:31:03,907 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-20 13:31:03,907 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-20 13:31:03,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:31:03 BoogieIcfgContainer [2024-09-20 13:31:03,908 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 13:31:03,909 INFO L158 Benchmark]: Toolchain (without parser) took 6361.55ms. Allocated memory was 138.4MB in the beginning and 226.5MB in the end (delta: 88.1MB). Free memory was 83.7MB in the beginning and 142.5MB in the end (delta: -58.8MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-09-20 13:31:03,909 INFO L158 Benchmark]: Witness Parser took 0.24ms. Allocated memory is still 138.4MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:31:03,909 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:31:03,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.25ms. Allocated memory is still 138.4MB. Free memory was 83.7MB in the beginning and 70.2MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-20 13:31:03,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.56ms. Allocated memory is still 138.4MB. Free memory was 70.2MB in the beginning and 68.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:31:03,910 INFO L158 Benchmark]: Boogie Preprocessor took 32.98ms. Allocated memory is still 138.4MB. Free memory was 68.6MB in the beginning and 67.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 13:31:03,910 INFO L158 Benchmark]: RCFGBuilder took 276.52ms. Allocated memory is still 138.4MB. Free memory was 67.0MB in the beginning and 53.4MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-20 13:31:03,910 INFO L158 Benchmark]: TraceAbstraction took 5732.62ms. Allocated memory was 138.4MB in the beginning and 226.5MB in the end (delta: 88.1MB). Free memory was 52.9MB in the beginning and 142.5MB in the end (delta: -89.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:31:03,911 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.24ms. Allocated memory is still 138.4MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.25ms. Allocated memory is still 138.4MB. Free memory was 83.7MB in the beginning and 70.2MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.56ms. Allocated memory is still 138.4MB. Free memory was 70.2MB in the beginning and 68.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.98ms. Allocated memory is still 138.4MB. Free memory was 68.6MB in the beginning and 67.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 276.52ms. Allocated memory is still 138.4MB. Free memory was 67.0MB in the beginning and 53.4MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5732.62ms. Allocated memory was 138.4MB in the beginning and 226.5MB in the end (delta: 88.1MB). Free memory was 52.9MB in the beginning and 142.5MB in the end (delta: -89.6MB). 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: 5.7s, OverallIterations: 13, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 815 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 460 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 868 IncrementalHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 355 mSDtfsCounter, 868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 485 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=9, InterpolantAutomatonStates: 68, 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, 13 MinimizatonAttempts, 19 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 620 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 793 ConstructedInterpolants, 0 QuantifiedInterpolants, 2378 SizeOfPredicates, 0 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 3024/3113 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-20 13:31:03,936 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