./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/bresenham-ll_valuebound2.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/nla-digbench-scaling/bresenham-ll_valuebound2.c ../results/automizer-verification-files/SV-COMP24_unreach-call/bresenham-ll_valuebound2.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-04d6fb3-m [2024-09-15 20:12:33,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 20:12:33,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 20:12:33,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 20:12:33,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 20:12:33,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 20:12:33,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 20:12:33,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 20:12:33,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 20:12:33,615 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 20:12:33,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 20:12:33,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 20:12:33,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 20:12:33,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 20:12:33,620 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 20:12:33,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 20:12:33,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 20:12:33,621 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 20:12:33,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 20:12:33,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 20:12:33,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 20:12:33,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 20:12:33,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 20:12:33,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 20:12:33,627 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 20:12:33,627 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 20:12:33,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 20:12:33,628 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 20:12:33,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 20:12:33,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 20:12:33,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 20:12:33,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 20:12:33,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:12:33,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 20:12:33,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 20:12:33,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 20:12:33,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 20:12:33,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 20:12:33,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 20:12:33,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 20:12:33,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 20:12:33,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 20:12:33,636 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:12:33,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 20:12:33,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 20:12:33,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 20:12:33,998 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-15 20:12:33,999 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-15 20:12:34,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/bresenham-ll_valuebound2.yml/witness-2.1.yml [2024-09-15 20:12:34,051 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 20:12:34,052 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 20:12:34,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.c [2024-09-15 20:12:35,477 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 20:12:35,652 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 20:12:35,653 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_valuebound2.c [2024-09-15 20:12:35,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/00efc02bf/404d36ae09bb4e339c112e0db116538b/FLAGcd344fd34 [2024-09-15 20:12:35,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/00efc02bf/404d36ae09bb4e339c112e0db116538b [2024-09-15 20:12:35,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 20:12:35,683 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-15 20:12:35,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 20:12:35,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 20:12:35,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 20:12:35,691 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:12:34" (1/2) ... [2024-09-15 20:12:35,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794ed58e and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:12:35, skipping insertion in model container [2024-09-15 20:12:35,695 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:12:34" (1/2) ... [2024-09-15 20:12:35,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@66a0a23e and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:12:35, skipping insertion in model container [2024-09-15 20:12:35,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:12:35" (2/2) ... [2024-09-15 20:12:35,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794ed58e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:12:35, skipping insertion in model container [2024-09-15 20:12:35,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:12:35" (2/2) ... [2024-09-15 20:12:35,709 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-15 20:12:35,709 INFO L1541 ArrayList]: Loop invariant at [L32-L47] (((((X <= 2) && ((((long long) Y * 2) + (2 * ((__int128) Y * x))) == (((((__int128) X * y) * 2) + X) + v))) && (0 <= Y)) && (0 <= X)) && (Y <= 2)) [2024-09-15 20:12:35,710 INFO L1541 ArrayList]: Function contract at [L13]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-15 20:12:35,710 INFO L1541 ArrayList]: Function contract at [L10]: requires null, ensures (\old(cond) != 0) [2024-09-15 20:12:35,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 20:12:35,889 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/nla-digbench-scaling/bresenham-ll_valuebound2.c[597,610] [2024-09-15 20:12:35,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:12:35,929 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-15 20:12:35,983 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/nla-digbench-scaling/bresenham-ll_valuebound2.c[597,610] Start Parsing Local [2024-09-15 20:12:36,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:12:36,021 INFO L204 MainTranslator]: Completed translation [2024-09-15 20:12:36,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:12:36 WrapperNode [2024-09-15 20:12:36,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 20:12:36,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 20:12:36,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 20:12:36,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 20:12:36,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:12:36" (1/1) ... [2024-09-15 20:12:36,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:12:36" (1/1) ... [2024-09-15 20:12:36,053 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2024-09-15 20:12:36,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 20:12:36,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 20:12:36,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 20:12:36,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 20:12:36,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:12:36" (1/1) ... [2024-09-15 20:12:36,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:12:36" (1/1) ... [2024-09-15 20:12:36,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:12:36" (1/1) ... [2024-09-15 20:12:36,083 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure assume_abort_if_not is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-15 20:12:36,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:12:36" (1/1) ... [2024-09-15 20:12:36,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:12:36" (1/1) ... [2024-09-15 20:12:36,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:12:36" (1/1) ... [2024-09-15 20:12:36,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:12:36" (1/1) ... [2024-09-15 20:12:36,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:12:36" (1/1) ... [2024-09-15 20:12:36,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:12:36" (1/1) ... [2024-09-15 20:12:36,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 20:12:36,102 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 20:12:36,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 20:12:36,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 20:12:36,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:12:36" (1/1) ... [2024-09-15 20:12:36,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:12:36,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:12:36,136 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:12:36,144 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:12:36,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 20:12:36,188 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-15 20:12:36,188 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-15 20:12:36,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-15 20:12:36,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 20:12:36,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 20:12:36,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-15 20:12:36,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-15 20:12:36,256 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 20:12:36,258 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 20:12:36,446 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-15 20:12:36,472 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-09-15 20:12:36,472 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 20:12:36,501 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 20:12:36,503 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-15 20:12:36,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:12:36 BoogieIcfgContainer [2024-09-15 20:12:36,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 20:12:36,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 20:12:36,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 20:12:36,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 20:12:36,512 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:12:34" (1/4) ... [2024-09-15 20:12:36,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679ffa8 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 15.09 08:12:36, skipping insertion in model container [2024-09-15 20:12:36,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 08:12:35" (2/4) ... [2024-09-15 20:12:36,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679ffa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:12:36, skipping insertion in model container [2024-09-15 20:12:36,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:12:36" (3/4) ... [2024-09-15 20:12:36,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679ffa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:12:36, skipping insertion in model container [2024-09-15 20:12:36,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:12:36" (4/4) ... [2024-09-15 20:12:36,516 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound2.c [2024-09-15 20:12:36,535 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 20:12:36,535 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-09-15 20:12:36,603 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 20:12:36,610 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;@3605a6b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 20:12:36,612 INFO L337 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-09-15 20:12:36,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 23 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-15 20:12:36,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-15 20:12:36,625 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:12:36,625 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-15 20:12:36,626 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:12:36,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:12:36,634 INFO L85 PathProgramCache]: Analyzing trace with hash 97994615, now seen corresponding path program 1 times [2024-09-15 20:12:36,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:12:36,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600866877] [2024-09-15 20:12:36,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:36,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:12:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:36,784 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:12:36,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:12:36,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600866877] [2024-09-15 20:12:36,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600866877] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:12:36,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:12:36,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 20:12:36,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252287711] [2024-09-15 20:12:36,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:12:36,792 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-15 20:12:36,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:12:36,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-15 20:12:36,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-15 20:12:36,824 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 23 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:12:36,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:12:36,843 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-09-15 20:12:36,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-15 20:12:36,845 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-15 20:12:36,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:12:36,851 INFO L225 Difference]: With dead ends: 30 [2024-09-15 20:12:36,851 INFO L226 Difference]: Without dead ends: 28 [2024-09-15 20:12:36,853 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-15 20:12:36,857 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:12:36,859 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:12:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-15 20:12:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-15 20:12:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-15 20:12:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-09-15 20:12:36,895 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 5 [2024-09-15 20:12:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:12:36,896 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-09-15 20:12:36,896 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:12:36,897 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-09-15 20:12:36,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-15 20:12:36,897 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:12:36,897 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-15 20:12:36,898 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 20:12:36,898 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:12:36,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:12:36,899 INFO L85 PathProgramCache]: Analyzing trace with hash 97994677, now seen corresponding path program 1 times [2024-09-15 20:12:36,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:12:36,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537997778] [2024-09-15 20:12:36,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:36,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:12:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:37,021 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:12:37,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:12:37,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537997778] [2024-09-15 20:12:37,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537997778] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:12:37,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:12:37,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:12:37,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179487375] [2024-09-15 20:12:37,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:12:37,026 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:12:37,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:12:37,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:12:37,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:12:37,027 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:12:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:12:37,065 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-09-15 20:12:37,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:12:37,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-15 20:12:37,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:12:37,069 INFO L225 Difference]: With dead ends: 27 [2024-09-15 20:12:37,069 INFO L226 Difference]: Without dead ends: 27 [2024-09-15 20:12:37,070 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:12:37,071 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:12:37,072 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:12:37,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-15 20:12:37,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-15 20:12:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-15 20:12:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-09-15 20:12:37,079 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 5 [2024-09-15 20:12:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:12:37,079 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-09-15 20:12:37,079 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:12:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-09-15 20:12:37,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-15 20:12:37,080 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:12:37,080 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:12:37,081 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 20:12:37,081 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:12:37,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:12:37,082 INFO L85 PathProgramCache]: Analyzing trace with hash -257595004, now seen corresponding path program 1 times [2024-09-15 20:12:37,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:12:37,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771519627] [2024-09-15 20:12:37,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:37,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:12:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 20:12:37,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737874438] [2024-09-15 20:12:37,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:37,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:12:37,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:12:37,127 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:12:37,128 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:12:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:37,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-15 20:12:37,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:12:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-15 20:12:37,404 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-15 20:12:37,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:12:37,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771519627] [2024-09-15 20:12:37,407 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 20:12:37,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737874438] [2024-09-15 20:12:37,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737874438] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:12:37,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:12:37,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:12:37,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571382313] [2024-09-15 20:12:37,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:12:37,409 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 20:12:37,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:12:37,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 20:12:37,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:12:37,410 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-15 20:12:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:12:37,506 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-09-15 20:12:37,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 20:12:37,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-09-15 20:12:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:12:37,511 INFO L225 Difference]: With dead ends: 33 [2024-09-15 20:12:37,511 INFO L226 Difference]: Without dead ends: 33 [2024-09-15 20:12:37,511 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:12:37,512 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:12:37,512 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 36 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:12:37,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-15 20:12:37,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-09-15 20:12:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-15 20:12:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-09-15 20:12:37,522 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 14 [2024-09-15 20:12:37,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:12:37,523 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-09-15 20:12:37,524 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-15 20:12:37,524 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-09-15 20:12:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-15 20:12:37,525 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:12:37,525 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:12:37,543 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-15 20:12:37,729 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:12:37,730 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:12:37,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:12:37,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1559305831, now seen corresponding path program 1 times [2024-09-15 20:12:37,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:12:37,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78668688] [2024-09-15 20:12:37,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:37,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:12:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:37,920 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:12:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:37,927 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 20:12:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-15 20:12:37,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:12:37,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78668688] [2024-09-15 20:12:37,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78668688] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:12:37,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:12:37,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:12:37,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685008523] [2024-09-15 20:12:37,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:12:37,946 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:12:37,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:12:37,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:12:37,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:12:37,947 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 20:12:38,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:12:38,026 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-09-15 20:12:38,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:12:38,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-15 20:12:38,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:12:38,027 INFO L225 Difference]: With dead ends: 30 [2024-09-15 20:12:38,027 INFO L226 Difference]: Without dead ends: 30 [2024-09-15 20:12:38,027 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:12:38,028 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:12:38,029 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 49 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:12:38,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-15 20:12:38,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-15 20:12:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-15 20:12:38,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-09-15 20:12:38,033 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2024-09-15 20:12:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:12:38,033 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-09-15 20:12:38,034 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 20:12:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-09-15 20:12:38,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-15 20:12:38,034 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:12:38,034 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:12:38,035 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-15 20:12:38,035 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:12:38,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:12:38,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1084728619, now seen corresponding path program 1 times [2024-09-15 20:12:38,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:12:38,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276629187] [2024-09-15 20:12:38,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:38,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:12:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:38,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:12:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:38,132 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 20:12:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-15 20:12:38,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:12:38,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276629187] [2024-09-15 20:12:38,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276629187] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:12:38,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:12:38,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:12:38,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247966923] [2024-09-15 20:12:38,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:12:38,140 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:12:38,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:12:38,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:12:38,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:12:38,145 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 20:12:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:12:38,154 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-09-15 20:12:38,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:12:38,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-09-15 20:12:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:12:38,156 INFO L225 Difference]: With dead ends: 28 [2024-09-15 20:12:38,156 INFO L226 Difference]: Without dead ends: 28 [2024-09-15 20:12:38,156 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:12:38,157 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 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:12:38,157 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:12:38,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-15 20:12:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-15 20:12:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-15 20:12:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-09-15 20:12:38,165 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2024-09-15 20:12:38,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:12:38,165 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-09-15 20:12:38,165 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 20:12:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-09-15 20:12:38,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-15 20:12:38,166 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:12:38,166 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:12:38,166 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-15 20:12:38,166 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:12:38,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:12:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1084728458, now seen corresponding path program 1 times [2024-09-15 20:12:38,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:12:38,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716554545] [2024-09-15 20:12:38,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:12:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:38,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:12:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:38,217 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 20:12:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-15 20:12:38,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:12:38,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716554545] [2024-09-15 20:12:38,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716554545] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:12:38,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:12:38,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 20:12:38,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692237525] [2024-09-15 20:12:38,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:12:38,226 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:12:38,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:12:38,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:12:38,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:12:38,227 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 20:12:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:12:38,238 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-09-15 20:12:38,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:12:38,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-09-15 20:12:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:12:38,239 INFO L225 Difference]: With dead ends: 27 [2024-09-15 20:12:38,239 INFO L226 Difference]: Without dead ends: 27 [2024-09-15 20:12:38,239 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:12:38,240 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:12:38,240 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:12:38,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-15 20:12:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-15 20:12:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-15 20:12:38,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-09-15 20:12:38,244 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2024-09-15 20:12:38,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:12:38,245 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-09-15 20:12:38,245 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 20:12:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-09-15 20:12:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-15 20:12:38,246 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:12:38,246 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:12:38,246 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-15 20:12:38,246 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:12:38,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:12:38,247 INFO L85 PathProgramCache]: Analyzing trace with hash 740765052, now seen corresponding path program 1 times [2024-09-15 20:12:38,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:12:38,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901253764] [2024-09-15 20:12:38,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:38,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:12:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 20:12:38,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1955791662] [2024-09-15 20:12:38,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:38,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:12:38,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:12:38,275 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:12:38,277 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:12:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:38,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-15 20:12:38,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:12:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-15 20:12:38,595 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:12:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-15 20:12:38,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:12:38,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901253764] [2024-09-15 20:12:38,803 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 20:12:38,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955791662] [2024-09-15 20:12:38,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955791662] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-15 20:12:38,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-15 20:12:38,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-09-15 20:12:38,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189285409] [2024-09-15 20:12:38,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:12:38,804 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:12:38,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:12:38,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:12:38,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-15 20:12:38,805 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-15 20:12:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:12:38,858 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2024-09-15 20:12:38,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:12:38,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-09-15 20:12:38,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:12:38,860 INFO L225 Difference]: With dead ends: 26 [2024-09-15 20:12:38,860 INFO L226 Difference]: Without dead ends: 26 [2024-09-15 20:12:38,860 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-15 20:12:38,861 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:12:38,861 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:12:38,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-15 20:12:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-15 20:12:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-15 20:12:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-09-15 20:12:38,867 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2024-09-15 20:12:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:12:38,867 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-09-15 20:12:38,867 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-15 20:12:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-09-15 20:12:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-15 20:12:38,870 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:12:38,871 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:12:38,889 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:12:39,071 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-15 20:12:39,072 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:12:39,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:12:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash 439517328, now seen corresponding path program 1 times [2024-09-15 20:12:39,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:12:39,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404368774] [2024-09-15 20:12:39,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:39,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:12:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:39,197 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:12:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:39,202 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 20:12:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:39,205 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-15 20:12:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:39,215 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-15 20:12:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:39,220 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-15 20:12:39,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:12:39,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404368774] [2024-09-15 20:12:39,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404368774] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:12:39,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671991860] [2024-09-15 20:12:39,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:39,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:12:39,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:12:39,223 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 20:12:39,225 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-15 20:12:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:39,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-15 20:12:39,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:12:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-15 20:12:39,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:12:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-15 20:12:39,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671991860] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 20:12:39,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 20:12:39,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-09-15 20:12:39,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921081699] [2024-09-15 20:12:39,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 20:12:39,462 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-15 20:12:39,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:12:39,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-15 20:12:39,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-09-15 20:12:39,463 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-15 20:12:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:12:39,599 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-09-15 20:12:39,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 20:12:39,599 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 33 [2024-09-15 20:12:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:12:39,600 INFO L225 Difference]: With dead ends: 35 [2024-09-15 20:12:39,600 INFO L226 Difference]: Without dead ends: 35 [2024-09-15 20:12:39,600 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-09-15 20:12:39,601 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:12:39,601 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 91 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:12:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-15 20:12:39,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-09-15 20:12:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-15 20:12:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-09-15 20:12:39,607 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 33 [2024-09-15 20:12:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:12:39,607 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-09-15 20:12:39,608 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-15 20:12:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-09-15 20:12:39,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-15 20:12:39,611 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:12:39,611 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:12:39,627 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-15 20:12:39,812 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-15 20:12:39,812 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:12:39,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:12:39,813 INFO L85 PathProgramCache]: Analyzing trace with hash 697682766, now seen corresponding path program 1 times [2024-09-15 20:12:39,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:12:39,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257725565] [2024-09-15 20:12:39,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:39,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:12:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 20:12:39,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1524405225] [2024-09-15 20:12:39,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:39,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:12:39,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:12:39,827 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 20:12:39,829 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-15 20:12:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:39,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-15 20:12:39,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:12:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-15 20:12:40,118 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:12:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-15 20:12:40,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:12:40,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257725565] [2024-09-15 20:12:40,694 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 20:12:40,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524405225] [2024-09-15 20:12:40,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524405225] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 20:12:40,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-15 20:12:40,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2024-09-15 20:12:40,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746769766] [2024-09-15 20:12:40,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-15 20:12:40,695 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-15 20:12:40,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:12:40,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-15 20:12:40,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-09-15 20:12:40,696 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-15 20:12:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:12:41,868 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2024-09-15 20:12:41,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-15 20:12:41,868 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 33 [2024-09-15 20:12:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:12:41,869 INFO L225 Difference]: With dead ends: 49 [2024-09-15 20:12:41,869 INFO L226 Difference]: Without dead ends: 45 [2024-09-15 20:12:41,870 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2024-09-15 20:12:41,870 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 20:12:41,870 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 115 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 20:12:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-15 20:12:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2024-09-15 20:12:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-15 20:12:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-09-15 20:12:41,875 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 33 [2024-09-15 20:12:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:12:41,876 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-09-15 20:12:41,876 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-15 20:12:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-09-15 20:12:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-15 20:12:41,877 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:12:41,877 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:12:41,894 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-15 20:12:42,078 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:12:42,078 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:12:42,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:12:42,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1339848296, now seen corresponding path program 2 times [2024-09-15 20:12:42,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:12:42,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243787748] [2024-09-15 20:12:42,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:42,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:12:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 20:12:42,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575590443] [2024-09-15 20:12:42,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-15 20:12:42,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:12:42,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:12:42,098 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 20:12:42,099 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-15 20:12:42,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-15 20:12:42,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 20:12:42,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-15 20:12:42,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:12:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-15 20:12:42,302 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-15 20:12:42,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:12:42,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243787748] [2024-09-15 20:12:42,302 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 20:12:42,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575590443] [2024-09-15 20:12:42,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575590443] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:12:42,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:12:42,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-15 20:12:42,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410174160] [2024-09-15 20:12:42,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:12:42,303 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:12:42,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:12:42,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:12:42,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:12:42,304 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-15 20:12:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:12:42,378 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-09-15 20:12:42,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 20:12:42,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2024-09-15 20:12:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:12:42,380 INFO L225 Difference]: With dead ends: 51 [2024-09-15 20:12:42,380 INFO L226 Difference]: Without dead ends: 49 [2024-09-15 20:12:42,381 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:12:42,381 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:12:42,382 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 32 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:12:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-15 20:12:42,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2024-09-15 20:12:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-15 20:12:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-09-15 20:12:42,390 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 43 [2024-09-15 20:12:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:12:42,390 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-09-15 20:12:42,390 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-15 20:12:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-09-15 20:12:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-15 20:12:42,394 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:12:42,394 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:12:42,411 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-15 20:12:42,598 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-15 20:12:42,599 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:12:42,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:12:42,599 INFO L85 PathProgramCache]: Analyzing trace with hash 189685214, now seen corresponding path program 1 times [2024-09-15 20:12:42,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:12:42,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658433265] [2024-09-15 20:12:42,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:42,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:12:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:42,728 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:12:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:42,730 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 20:12:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:42,733 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-15 20:12:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:42,739 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-15 20:12:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:42,744 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-15 20:12:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:42,747 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-15 20:12:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-09-15 20:12:42,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:12:42,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658433265] [2024-09-15 20:12:42,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658433265] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:12:42,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:12:42,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:12:42,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328367458] [2024-09-15 20:12:42,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:12:42,750 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:12:42,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:12:42,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:12:42,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:12:42,751 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-15 20:12:42,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:12:42,796 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-09-15 20:12:42,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:12:42,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 53 [2024-09-15 20:12:42,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:12:42,797 INFO L225 Difference]: With dead ends: 44 [2024-09-15 20:12:42,797 INFO L226 Difference]: Without dead ends: 38 [2024-09-15 20:12:42,798 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:12:42,798 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:12:42,798 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 48 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:12:42,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-15 20:12:42,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-15 20:12:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-15 20:12:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-15 20:12:42,801 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 53 [2024-09-15 20:12:42,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:12:42,802 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-15 20:12:42,802 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-15 20:12:42,802 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-15 20:12:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-15 20:12:42,802 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:12:42,803 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:12:42,803 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-15 20:12:42,803 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:12:42,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:12:42,803 INFO L85 PathProgramCache]: Analyzing trace with hash 245590110, now seen corresponding path program 2 times [2024-09-15 20:12:42,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:12:42,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177611441] [2024-09-15 20:12:42,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:42,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:12:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:42,881 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:12:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:42,884 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 20:12:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:42,886 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-15 20:12:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:42,889 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-15 20:12:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:42,893 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-15 20:12:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:42,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-15 20:12:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-15 20:12:42,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:12:42,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177611441] [2024-09-15 20:12:42,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177611441] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:12:42,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948067239] [2024-09-15 20:12:42,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-15 20:12:42,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:12:42,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:12:42,902 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 20:12:42,903 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-15 20:12:42,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-15 20:12:42,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 20:12:42,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-15 20:12:42,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:12:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-15 20:12:43,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:12:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-15 20:12:43,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948067239] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 20:12:43,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 20:12:43,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-09-15 20:12:43,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356241884] [2024-09-15 20:12:43,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 20:12:43,087 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 20:12:43,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:12:43,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 20:12:43,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:12:43,090 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-15 20:12:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:12:43,239 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2024-09-15 20:12:43,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 20:12:43,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 53 [2024-09-15 20:12:43,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:12:43,242 INFO L225 Difference]: With dead ends: 57 [2024-09-15 20:12:43,242 INFO L226 Difference]: Without dead ends: 57 [2024-09-15 20:12:43,242 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-15 20:12:43,243 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:12:43,244 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 78 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:12:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-15 20:12:43,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-09-15 20:12:43,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-15 20:12:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-09-15 20:12:43,253 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 53 [2024-09-15 20:12:43,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:12:43,253 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-09-15 20:12:43,254 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-15 20:12:43,254 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2024-09-15 20:12:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-15 20:12:43,257 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:12:43,257 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:12:43,270 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-15 20:12:43,458 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-15 20:12:43,458 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:12:43,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:12:43,459 INFO L85 PathProgramCache]: Analyzing trace with hash 464444828, now seen corresponding path program 3 times [2024-09-15 20:12:43,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:12:43,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357852405] [2024-09-15 20:12:43,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:12:43,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:12:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:43,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:12:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:43,694 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 20:12:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:43,697 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-15 20:12:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:43,706 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-15 20:12:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:43,722 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-15 20:12:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:43,733 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-15 20:12:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:12:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-15 20:12:43,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:12:43,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357852405] [2024-09-15 20:12:43,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357852405] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:12:43,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503873543] [2024-09-15 20:12:43,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-15 20:12:43,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:12:43,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:12:43,742 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 20:12:43,744 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-15 20:12:43,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-15 20:12:43,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 20:12:43,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-15 20:12:43,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:12:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-09-15 20:12:44,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:12:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-09-15 20:12:45,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503873543] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-15 20:12:45,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-15 20:12:45,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 10] total 24 [2024-09-15 20:12:45,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613447599] [2024-09-15 20:12:45,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:12:45,955 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 20:12:45,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:12:45,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 20:12:45,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2024-09-15 20:12:45,956 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-15 20:12:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:12:46,738 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2024-09-15 20:12:46,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-15 20:12:46,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2024-09-15 20:12:46,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:12:46,739 INFO L225 Difference]: With dead ends: 54 [2024-09-15 20:12:46,739 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 20:12:46,739 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-09-15 20:12:46,740 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-15 20:12:46,740 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 69 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-15 20:12:46,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 20:12:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 20:12:46,741 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:12:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 20:12:46,741 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2024-09-15 20:12:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:12:46,741 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 20:12:46,741 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-15 20:12:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 20:12:46,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 20:12:46,744 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-09-15 20:12:46,744 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (4 of 6 remaining) [2024-09-15 20:12:46,744 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (3 of 6 remaining) [2024-09-15 20:12:46,744 INFO L785 garLoopResultBuilder]: Registering result SAFE for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 6 remaining) [2024-09-15 20:12:46,744 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-09-15 20:12:46,745 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 6 remaining) [2024-09-15 20:12:46,761 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-15 20:12:46,948 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:12:46,952 INFO L408 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:12:46,954 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 20:12:46,956 INFO L469 ceAbstractionStarter]: Automizer considered 1 witness invariants [2024-09-15 20:12:46,956 INFO L470 ceAbstractionStarter]: WitnessConsidered=1 [2024-09-15 20:12:46,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 08:12:46 BoogieIcfgContainer [2024-09-15 20:12:46,957 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 20:12:46,957 INFO L158 Benchmark]: Toolchain (without parser) took 11275.00ms. Allocated memory was 73.4MB in the beginning and 136.3MB in the end (delta: 62.9MB). Free memory was 45.0MB in the beginning and 67.8MB in the end (delta: -22.8MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-09-15 20:12:46,958 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 48.2MB. Free memory was 29.1MB in the beginning and 29.1MB in the end (delta: 60.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:12:46,958 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 48.2MB. Free memory was 27.1MB in the beginning and 27.0MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:12:46,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.31ms. Allocated memory is still 73.4MB. Free memory was 44.8MB in the beginning and 50.6MB in the end (delta: -5.9MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2024-09-15 20:12:46,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.68ms. Allocated memory is still 73.4MB. Free memory was 50.6MB in the beginning and 49.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 20:12:46,959 INFO L158 Benchmark]: Boogie Preprocessor took 45.30ms. Allocated memory is still 73.4MB. Free memory was 49.0MB in the beginning and 47.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:12:46,959 INFO L158 Benchmark]: RCFGBuilder took 403.07ms. Allocated memory is still 73.4MB. Free memory was 47.6MB in the beginning and 34.0MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-15 20:12:46,959 INFO L158 Benchmark]: TraceAbstraction took 10450.33ms. Allocated memory was 73.4MB in the beginning and 136.3MB in the end (delta: 62.9MB). Free memory was 33.4MB in the beginning and 67.8MB in the end (delta: -34.4MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2024-09-15 20:12:46,960 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.21ms. Allocated memory is still 48.2MB. Free memory was 29.1MB in the beginning and 29.1MB in the end (delta: 60.8kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.96ms. Allocated memory is still 48.2MB. Free memory was 27.1MB in the beginning and 27.0MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.31ms. Allocated memory is still 73.4MB. Free memory was 44.8MB in the beginning and 50.6MB in the end (delta: -5.9MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.68ms. Allocated memory is still 73.4MB. Free memory was 50.6MB in the beginning and 49.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.30ms. Allocated memory is still 73.4MB. Free memory was 49.0MB in the beginning and 47.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 403.07ms. Allocated memory is still 73.4MB. Free memory was 47.6MB in the beginning and 34.0MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10450.33ms. Allocated memory was 73.4MB in the beginning and 136.3MB in the end (delta: 62.9MB). Free memory was 33.4MB in the beginning and 67.8MB in the end (delta: -34.4MB). Peak memory consumption was 28.9MB. 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: 32]: 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: 10]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 16]: 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 3 procedures, 30 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 747 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 494 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 687 IncrementalHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 253 mSDtfsCounter, 687 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 552 GetRequests, 456 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=12, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 623 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 684 ConstructedInterpolants, 1 QuantifiedInterpolants, 3369 SizeOfPredicates, 8 NumberOfNonLiveVariables, 650 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 433/522 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-15 20:12:46,985 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