./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/hh2012-ex1b.i --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/hh2012-ex1b.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 04d6fb36 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/loop-lit/hh2012-ex1b.i ../results/automizer-verification-files/SV-COMP24_unreach-call/hh2012-ex1b.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-04d6fb3-m [2024-09-15 20:10:55,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 20:10:55,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 20:10:55,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 20:10:55,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 20:10:55,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 20:10:55,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 20:10:55,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 20:10:55,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 20:10:55,155 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 20:10:55,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 20:10:55,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 20:10:55,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 20:10:55,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 20:10:55,157 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 20:10:55,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 20:10:55,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 20:10:55,158 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 20:10:55,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 20:10:55,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 20:10:55,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 20:10:55,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 20:10:55,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 20:10:55,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 20:10:55,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 20:10:55,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 20:10:55,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 20:10:55,165 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 20:10:55,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 20:10:55,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 20:10:55,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 20:10:55,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 20:10:55,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:10:55,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 20:10:55,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 20:10:55,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 20:10:55,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 20:10:55,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 20:10:55,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 20:10:55,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 20:10:55,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 20:10:55,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 20:10:55,173 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-15 20:10:55,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 20:10:55,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 20:10:55,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 20:10:55,503 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 20:10:55,504 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 20:10:55,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/hh2012-ex1b.i [2024-09-15 20:10:56,903 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 20:10:57,061 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 20:10:57,062 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/hh2012-ex1b.i [2024-09-15 20:10:57,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/1eebc4007/38ae13e08f4e43cc9e59be9c5b984ca0/FLAG98ad35f1e [2024-09-15 20:10:57,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/1eebc4007/38ae13e08f4e43cc9e59be9c5b984ca0 [2024-09-15 20:10:57,083 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-15 20:10:57,083 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-15 20:10:57,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/hh2012-ex1b.yml/witness-2.1.yml [2024-09-15 20:10:57,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 20:10:57,128 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-15 20:10:57,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 20:10:57,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 20:10:57,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 20:10:57,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:10:57" (1/2) ... [2024-09-15 20:10:57,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23daf052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:57, skipping insertion in model container [2024-09-15 20:10:57,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:10:57" (1/2) ... [2024-09-15 20:10:57,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5af0ff6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:57, skipping insertion in model container [2024-09-15 20:10:57,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:10:57" (2/2) ... [2024-09-15 20:10:57,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23daf052 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57, skipping insertion in model container [2024-09-15 20:10:57,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:10:57" (2/2) ... [2024-09-15 20:10:57,147 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-15 20:10:57,148 INFO L1541 ArrayList]: Loop invariant at [L16-L25] (i < 101) [2024-09-15 20:10:57,149 INFO L1541 ArrayList]: Loop invariant at [L18-L21] ((i <= 99) && (j <= 100)) [2024-09-15 20:10:57,149 INFO L1541 ArrayList]: Function contract at [L13]: requires (\old(cond) != 0), ensures (\old(cond) != 0) [2024-09-15 20:10:57,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 20:10:57,287 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/hh2012-ex1b.i[800,813] [2024-09-15 20:10:57,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:10:57,308 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global [2024-09-15 20:10:57,357 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/hh2012-ex1b.i[800,813] Start Parsing Local Start Parsing Local [2024-09-15 20:10:57,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:10:57,376 INFO L204 MainTranslator]: Completed translation [2024-09-15 20:10:57,377 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57 WrapperNode [2024-09-15 20:10:57,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 20:10:57,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 20:10:57,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 20:10:57,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 20:10:57,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57" (1/1) ... [2024-09-15 20:10:57,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57" (1/1) ... [2024-09-15 20:10:57,405 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2024-09-15 20:10:57,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 20:10:57,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 20:10:57,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 20:10:57,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 20:10:57,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57" (1/1) ... [2024-09-15 20:10:57,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57" (1/1) ... [2024-09-15 20:10:57,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57" (1/1) ... [2024-09-15 20:10:57,421 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-15 20:10:57,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57" (1/1) ... [2024-09-15 20:10:57,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57" (1/1) ... [2024-09-15 20:10:57,423 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57" (1/1) ... [2024-09-15 20:10:57,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57" (1/1) ... [2024-09-15 20:10:57,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57" (1/1) ... [2024-09-15 20:10:57,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57" (1/1) ... [2024-09-15 20:10:57,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 20:10:57,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 20:10:57,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 20:10:57,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 20:10:57,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57" (1/1) ... [2024-09-15 20:10:57,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:10:57,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:10:57,457 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-15 20:10:57,470 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-15 20:10:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 20:10:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-15 20:10:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 20:10:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 20:10:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-15 20:10:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-15 20:10:57,561 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 20:10:57,563 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 20:10:57,640 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-15 20:10:57,652 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-09-15 20:10:57,652 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 20:10:57,667 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 20:10:57,667 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-15 20:10:57,668 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:10:57 BoogieIcfgContainer [2024-09-15 20:10:57,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 20:10:57,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 20:10:57,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 20:10:57,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 20:10:57,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 08:10:57" (1/4) ... [2024-09-15 20:10:57,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd785a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:10:57, skipping insertion in model container [2024-09-15 20:10:57,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:10:57" (2/4) ... [2024-09-15 20:10:57,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd785a5 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 15.09 08:10:57, skipping insertion in model container [2024-09-15 20:10:57,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:10:57" (3/4) ... [2024-09-15 20:10:57,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd785a5 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 15.09 08:10:57, skipping insertion in model container [2024-09-15 20:10:57,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:10:57" (4/4) ... [2024-09-15 20:10:57,676 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex1b.i [2024-09-15 20:10:57,688 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 20:10:57,688 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-09-15 20:10:57,733 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 20:10:57,748 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;@19c4ffae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 20:10:57,748 INFO L337 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-09-15 20:10:57,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-15 20:10:57,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-09-15 20:10:57,761 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:57,761 INFO L216 NwaCegarLoop]: trace histogram [1, 1] [2024-09-15 20:10:57,762 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 5 more)] === [2024-09-15 20:10:57,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:57,769 INFO L85 PathProgramCache]: Analyzing trace with hash 3042, now seen corresponding path program 1 times [2024-09-15 20:10:57,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:57,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922031596] [2024-09-15 20:10:57,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:57,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:57,906 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-15 20:10:57,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:57,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922031596] [2024-09-15 20:10:57,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922031596] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:57,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:57,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-15 20:10:57,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811692247] [2024-09-15 20:10:57,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:57,913 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:10:57,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:57,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:10:57,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:10:57,946 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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-15 20:10:57,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:57,984 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-09-15 20:10:57,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:10:57,987 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-15 20:10:57,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:57,993 INFO L225 Difference]: With dead ends: 35 [2024-09-15 20:10:57,993 INFO L226 Difference]: Without dead ends: 33 [2024-09-15 20:10:57,994 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-15 20:10:57,997 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:57,997 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 40 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:10:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-15 20:10:58,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2024-09-15 20:10:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-15 20:10:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-09-15 20:10:58,043 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 2 [2024-09-15 20:10:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:58,043 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-09-15 20:10:58,044 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-15 20:10:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-09-15 20:10:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-09-15 20:10:58,044 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:58,044 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-09-15 20:10:58,049 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 20:10:58,050 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 5 more)] === [2024-09-15 20:10:58,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:58,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2924741, now seen corresponding path program 1 times [2024-09-15 20:10:58,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:58,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634292012] [2024-09-15 20:10:58,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:58,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:58,152 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-15 20:10:58,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:58,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634292012] [2024-09-15 20:10:58,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634292012] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:58,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:58,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 20:10:58,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522415944] [2024-09-15 20:10:58,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:58,154 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:58,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:58,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:58,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:58,155 INFO L87 Difference]: Start difference. First operand 26 states and 30 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-15 20:10:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:58,203 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-09-15 20:10:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:58,203 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-15 20:10:58,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:58,206 INFO L225 Difference]: With dead ends: 35 [2024-09-15 20:10:58,206 INFO L226 Difference]: Without dead ends: 35 [2024-09-15 20:10:58,207 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-15 20:10:58,208 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:58,208 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 47 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:10:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-15 20:10:58,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2024-09-15 20:10:58,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 24 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-15 20:10:58,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-09-15 20:10:58,215 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 4 [2024-09-15 20:10:58,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:58,216 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-09-15 20:10:58,216 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-15 20:10:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-09-15 20:10:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-09-15 20:10:58,217 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:58,217 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-09-15 20:10:58,218 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 20:10:58,218 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 5 more)] === [2024-09-15 20:10:58,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:58,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1484289464, now seen corresponding path program 1 times [2024-09-15 20:10:58,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:58,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949304873] [2024-09-15 20:10:58,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:58,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:58,294 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-15 20:10:58,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:58,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949304873] [2024-09-15 20:10:58,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949304873] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:58,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:58,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:58,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558307146] [2024-09-15 20:10:58,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:58,297 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:58,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:58,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:58,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:58,299 INFO L87 Difference]: Start difference. First operand 28 states and 32 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-15 20:10:58,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:58,341 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-09-15 20:10:58,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:58,342 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-15 20:10:58,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:58,342 INFO L225 Difference]: With dead ends: 33 [2024-09-15 20:10:58,344 INFO L226 Difference]: Without dead ends: 33 [2024-09-15 20:10:58,344 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-15 20:10:58,345 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:58,346 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:10:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-15 20:10:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-09-15 20:10:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-15 20:10:58,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-09-15 20:10:58,354 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 6 [2024-09-15 20:10:58,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:58,356 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-09-15 20:10:58,356 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-15 20:10:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-09-15 20:10:58,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-15 20:10:58,356 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:58,356 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:58,357 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-15 20:10:58,357 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 5 more)] === [2024-09-15 20:10:58,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:58,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1778088513, now seen corresponding path program 1 times [2024-09-15 20:10:58,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:58,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945938536] [2024-09-15 20:10:58,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:58,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:58,427 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-15 20:10:58,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:58,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945938536] [2024-09-15 20:10:58,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945938536] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:58,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:58,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:58,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714981056] [2024-09-15 20:10:58,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:58,429 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:10:58,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:58,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:10:58,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:10:58,430 INFO L87 Difference]: Start difference. First operand 32 states and 39 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-15 20:10:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:58,442 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2024-09-15 20:10:58,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:10:58,443 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-15 20:10:58,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:58,444 INFO L225 Difference]: With dead ends: 30 [2024-09-15 20:10:58,444 INFO L226 Difference]: Without dead ends: 30 [2024-09-15 20:10:58,444 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-15 20:10:58,447 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 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-15 20:10:58,448 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:10:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-15 20:10:58,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-15 20:10:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-15 20:10:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-09-15 20:10:58,454 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 9 [2024-09-15 20:10:58,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:58,454 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-09-15 20:10:58,454 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-15 20:10:58,454 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-09-15 20:10:58,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-15 20:10:58,455 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:58,455 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:58,456 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-15 20:10:58,456 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 5 more)] === [2024-09-15 20:10:58,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:58,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1778088352, now seen corresponding path program 1 times [2024-09-15 20:10:58,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:58,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876288377] [2024-09-15 20:10:58,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:58,493 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-15 20:10:58,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:58,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876288377] [2024-09-15 20:10:58,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876288377] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:58,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:58,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 20:10:58,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101217492] [2024-09-15 20:10:58,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:58,498 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:10:58,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:58,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:10:58,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:10:58,499 INFO L87 Difference]: Start difference. First operand 30 states and 37 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-15 20:10:58,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:58,524 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-09-15 20:10:58,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:10:58,525 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-15 20:10:58,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:58,525 INFO L225 Difference]: With dead ends: 29 [2024-09-15 20:10:58,526 INFO L226 Difference]: Without dead ends: 29 [2024-09-15 20:10:58,526 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-15 20:10:58,527 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:58,527 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:10:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-15 20:10:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-15 20:10:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-15 20:10:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-09-15 20:10:58,530 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 9 [2024-09-15 20:10:58,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:58,531 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-09-15 20:10:58,531 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-15 20:10:58,531 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-09-15 20:10:58,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-15 20:10:58,532 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:58,532 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:58,532 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-15 20:10:58,532 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 5 more)] === [2024-09-15 20:10:58,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:58,533 INFO L85 PathProgramCache]: Analyzing trace with hash 654078419, now seen corresponding path program 1 times [2024-09-15 20:10:58,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:58,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529512921] [2024-09-15 20:10:58,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:58,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:58,612 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 20:10:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:58,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:58,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529512921] [2024-09-15 20:10:58,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529512921] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:10:58,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847340379] [2024-09-15 20:10:58,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:58,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:10:58,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:10:58,640 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-15 20:10:58,644 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-15 20:10:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:58,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-15 20:10:58,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:10:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:58,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:10:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:10:58,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847340379] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 20:10:58,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 20:10:58,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-09-15 20:10:58,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52418358] [2024-09-15 20:10:58,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 20:10:58,829 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-15 20:10:58,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:58,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-15 20:10:58,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-09-15 20:10:58,832 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-15 20:10:58,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:58,933 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2024-09-15 20:10:58,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-15 20:10:58,933 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 11 [2024-09-15 20:10:58,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:58,934 INFO L225 Difference]: With dead ends: 45 [2024-09-15 20:10:58,934 INFO L226 Difference]: Without dead ends: 45 [2024-09-15 20:10:58,935 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-09-15 20:10:58,936 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:58,936 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 39 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:58,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-15 20:10:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-09-15 20:10:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-15 20:10:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2024-09-15 20:10:58,943 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 11 [2024-09-15 20:10:58,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:58,945 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-09-15 20:10:58,945 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-15 20:10:58,945 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-09-15 20:10:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-15 20:10:58,946 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:58,946 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2024-09-15 20:10:58,959 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-15 20:10:59,146 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-15 20:10:59,150 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 5 more)] === [2024-09-15 20:10:59,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:59,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2104410973, now seen corresponding path program 1 times [2024-09-15 20:10:59,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:59,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188637262] [2024-09-15 20:10:59,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:59,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 20:10:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 20:10:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,238 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-15 20:10:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-15 20:10:59,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:59,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188637262] [2024-09-15 20:10:59,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188637262] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:10:59,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:10:59,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:10:59,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477249787] [2024-09-15 20:10:59,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:10:59,245 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:10:59,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:59,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:10:59,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:10:59,245 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-15 20:10:59,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:59,278 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-09-15 20:10:59,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:10:59,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 27 [2024-09-15 20:10:59,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:59,280 INFO L225 Difference]: With dead ends: 42 [2024-09-15 20:10:59,280 INFO L226 Difference]: Without dead ends: 42 [2024-09-15 20:10:59,281 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-15 20:10:59,281 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:59,281 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 25 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:10:59,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-15 20:10:59,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-15 20:10:59,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-15 20:10:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-09-15 20:10:59,287 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 27 [2024-09-15 20:10:59,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:59,287 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-09-15 20:10:59,287 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-15 20:10:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-09-15 20:10:59,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-15 20:10:59,288 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:59,288 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:10:59,288 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-15 20:10:59,288 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 5 more)] === [2024-09-15 20:10:59,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:59,289 INFO L85 PathProgramCache]: Analyzing trace with hash -989099769, now seen corresponding path program 1 times [2024-09-15 20:10:59,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:59,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035153724] [2024-09-15 20:10:59,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:59,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,352 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 20:10:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 20:10:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-15 20:10:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-15 20:10:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,373 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-15 20:10:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-15 20:10:59,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:10:59,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035153724] [2024-09-15 20:10:59,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035153724] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:10:59,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845789548] [2024-09-15 20:10:59,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:59,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:10:59,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:10:59,382 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-15 20:10:59,382 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-15 20:10:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:10:59,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-15 20:10:59,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:10:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-15 20:10:59,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:10:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-15 20:10:59,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845789548] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 20:10:59,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 20:10:59,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 6] total 12 [2024-09-15 20:10:59,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937168583] [2024-09-15 20:10:59,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 20:10:59,544 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-15 20:10:59,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:10:59,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-15 20:10:59,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-09-15 20:10:59,545 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 9 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2024-09-15 20:10:59,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:10:59,736 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2024-09-15 20:10:59,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-15 20:10:59,736 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 9 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) Word has length 39 [2024-09-15 20:10:59,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:10:59,738 INFO L225 Difference]: With dead ends: 103 [2024-09-15 20:10:59,738 INFO L226 Difference]: Without dead ends: 103 [2024-09-15 20:10:59,739 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=486, Unknown=0, NotChecked=0, Total=756 [2024-09-15 20:10:59,739 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:10:59,740 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 60 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:10:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-09-15 20:10:59,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2024-09-15 20:10:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 53 states have internal predecessors, (56), 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-15 20:10:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2024-09-15 20:10:59,746 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 39 [2024-09-15 20:10:59,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:10:59,746 INFO L474 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2024-09-15 20:10:59,746 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 9 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2024-09-15 20:10:59,746 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2024-09-15 20:10:59,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-09-15 20:10:59,749 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:10:59,749 INFO L216 NwaCegarLoop]: trace histogram [19, 19, 19, 18, 16, 16, 16, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-09-15 20:10:59,761 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-15 20:10:59,953 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:10:59,954 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 5 more)] === [2024-09-15 20:10:59,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:10:59,954 INFO L85 PathProgramCache]: Analyzing trace with hash -2108094437, now seen corresponding path program 1 times [2024-09-15 20:10:59,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:10:59,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972243158] [2024-09-15 20:10:59,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:10:59,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:10:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,039 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 20:11:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,056 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 20:11:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,060 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-15 20:11:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,064 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-15 20:11:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,068 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-15 20:11:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,070 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-15 20:11:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,072 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-15 20:11:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,074 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-15 20:11:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-15 20:11:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-15 20:11:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-09-15 20:11:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-09-15 20:11:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-09-15 20:11:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-15 20:11:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-09-15 20:11:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,102 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-09-15 20:11:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,105 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-09-15 20:11:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,110 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-09-15 20:11:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,113 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-09-15 20:11:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-09-15 20:11:00,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:00,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972243158] [2024-09-15 20:11:00,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972243158] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:00,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:00,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:00,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306381809] [2024-09-15 20:11:00,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:00,118 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:11:00,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:00,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:11:00,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:11:00,119 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-15 20:11:00,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:00,161 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2024-09-15 20:11:00,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:11:00,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 140 [2024-09-15 20:11:00,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:00,162 INFO L225 Difference]: With dead ends: 73 [2024-09-15 20:11:00,162 INFO L226 Difference]: Without dead ends: 73 [2024-09-15 20:11:00,162 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 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-15 20:11:00,163 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:00,163 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 22 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:11:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-15 20:11:00,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-09-15 20:11:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 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-15 20:11:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2024-09-15 20:11:00,175 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 140 [2024-09-15 20:11:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:00,176 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2024-09-15 20:11:00,176 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-15 20:11:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2024-09-15 20:11:00,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-09-15 20:11:00,181 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:11:00,181 INFO L216 NwaCegarLoop]: trace histogram [20, 20, 20, 18, 16, 16, 16, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2024-09-15 20:11:00,181 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-15 20:11:00,182 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 5 more)] === [2024-09-15 20:11:00,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:11:00,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1562533426, now seen corresponding path program 1 times [2024-09-15 20:11:00,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:11:00,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545892849] [2024-09-15 20:11:00,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:11:00,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:11:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,312 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 20:11:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 20:11:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-15 20:11:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,320 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-15 20:11:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,322 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-15 20:11:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,323 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-15 20:11:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,326 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-15 20:11:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,327 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-15 20:11:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-15 20:11:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,330 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-15 20:11:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-09-15 20:11:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,340 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-09-15 20:11:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-09-15 20:11:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,343 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-15 20:11:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,345 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-09-15 20:11:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,346 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-09-15 20:11:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,348 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-09-15 20:11:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,351 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-09-15 20:11:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,353 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-09-15 20:11:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,354 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-09-15 20:11:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:11:00,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1196 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2024-09-15 20:11:00,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:11:00,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545892849] [2024-09-15 20:11:00,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545892849] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:11:00,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:11:00,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:11:00,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515410510] [2024-09-15 20:11:00,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:11:00,357 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:11:00,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:11:00,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:11:00,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:11:00,358 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-15 20:11:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:11:00,371 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2024-09-15 20:11:00,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:11:00,372 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), 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 148 [2024-09-15 20:11:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:11:00,372 INFO L225 Difference]: With dead ends: 72 [2024-09-15 20:11:00,372 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 20:11:00,372 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:11:00,373 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:11:00,373 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 20 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:11:00,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 20:11:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 20:11:00,373 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-15 20:11:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 20:11:00,373 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 148 [2024-09-15 20:11:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:11:00,373 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 20:11:00,374 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), 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-15 20:11:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 20:11:00,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 20:11:00,377 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 8 remaining) [2024-09-15 20:11:00,378 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 8 remaining) [2024-09-15 20:11:00,378 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (5 of 8 remaining) [2024-09-15 20:11:00,378 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (4 of 8 remaining) [2024-09-15 20:11:00,378 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION (3 of 8 remaining) [2024-09-15 20:11:00,378 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (2 of 8 remaining) [2024-09-15 20:11:00,378 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2024-09-15 20:11:00,378 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 8 remaining) [2024-09-15 20:11:00,378 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-15 20:11:00,380 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:11:00,382 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 20:11:00,383 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-15 20:11:00,383 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-15 20:11:00,384 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 08:11:00 BoogieIcfgContainer [2024-09-15 20:11:00,384 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 20:11:00,384 INFO L158 Benchmark]: Toolchain (without parser) took 3256.15ms. Allocated memory was 83.9MB in the beginning and 142.6MB in the end (delta: 58.7MB). Free memory was 49.0MB in the beginning and 54.3MB in the end (delta: -5.3MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2024-09-15 20:11:00,385 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:11:00,385 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:11:00,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.24ms. Allocated memory is still 83.9MB. Free memory was 48.7MB in the beginning and 63.3MB in the end (delta: -14.5MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-09-15 20:11:00,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.42ms. Allocated memory is still 83.9MB. Free memory was 63.3MB in the beginning and 62.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 20:11:00,385 INFO L158 Benchmark]: Boogie Preprocessor took 22.17ms. Allocated memory is still 83.9MB. Free memory was 61.6MB in the beginning and 60.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 20:11:00,386 INFO L158 Benchmark]: RCFGBuilder took 238.75ms. Allocated memory is still 83.9MB. Free memory was 60.2MB in the beginning and 49.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-15 20:11:00,386 INFO L158 Benchmark]: TraceAbstraction took 2714.89ms. Allocated memory was 83.9MB in the beginning and 142.6MB in the end (delta: 58.7MB). Free memory was 48.4MB in the beginning and 54.3MB in the end (delta: -5.9MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2024-09-15 20:11:00,387 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.24ms. Allocated memory is still 83.9MB. Free memory was 48.7MB in the beginning and 63.3MB in the end (delta: -14.5MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.42ms. Allocated memory is still 83.9MB. Free memory was 63.3MB in the beginning and 62.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.17ms. Allocated memory is still 83.9MB. Free memory was 61.6MB in the beginning and 60.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 238.75ms. Allocated memory is still 83.9MB. Free memory was 60.2MB in the beginning and 49.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2714.89ms. Allocated memory was 83.9MB in the beginning and 142.6MB in the end (delta: 58.7MB). Free memory was 48.4MB in the beginning and 54.3MB in the end (delta: -5.9MB). Peak memory consumption was 53.4MB. 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]: 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, 26 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 390 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 218 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 290 IncrementalHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 172 mSDtfsCounter, 290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=8, 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, 10 MinimizatonAttempts, 45 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 481 ConstructedInterpolants, 0 QuantifiedInterpolants, 722 SizeOfPredicates, 1 NumberOfNonLiveVariables, 134 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 2475/2509 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-15 20:11:00,408 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE