This is Ultimate 0.2.4-dev-1d5fa63-m [2024-09-13 10:25:45,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 10:25:45,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 10:25:45,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 10:25:45,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 10:25:45,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 10:25:45,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 10:25:45,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 10:25:45,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 10:25:45,814 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 10:25:45,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 10:25:45,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 10:25:45,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 10:25:45,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 10:25:45,816 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 10:25:45,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 10:25:45,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 10:25:45,817 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 10:25:45,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 10:25:45,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 10:25:45,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 10:25:45,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 10:25:45,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 10:25:45,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 10:25:45,823 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 10:25:45,823 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 10:25:45,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 10:25:45,824 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 10:25:45,824 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 10:25:45,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 10:25:45,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 10:25:45,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 10:25:45,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:25:45,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 10:25:45,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 10:25:45,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 10:25:45,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 10:25:45,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 10:25:45,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 10:25:45,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 10:25:45,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 10:25:45,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 10:25:45,830 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-13 10:25:46,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 10:25:46,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 10:25:46,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 10:25:46,131 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 10:25:46,132 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 10:25:46,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/prodbin-ll_valuebound5.yml/witness-2.1.yml [2024-09-13 10:25:46,180 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 10:25:46,180 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 10:25:46,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound5.c [2024-09-13 10:25:47,596 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 10:25:47,765 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 10:25:47,766 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound5.c [2024-09-13 10:25:47,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/3dc68a0c1/7b53ba6b7c98430f995cd47e2940118a/FLAGd3fd21459 [2024-09-13 10:25:47,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/3dc68a0c1/7b53ba6b7c98430f995cd47e2940118a [2024-09-13 10:25:47,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 10:25:47,788 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 10:25:47,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 10:25:47,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 10:25:47,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 10:25:47,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:25:46" (1/2) ... [2024-09-13 10:25:47,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bdb08bf and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:25:47, skipping insertion in model container [2024-09-13 10:25:47,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:25:46" (1/2) ... [2024-09-13 10:25:47,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@35c44066 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:25:47, skipping insertion in model container [2024-09-13 10:25:47,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:25:47" (2/2) ... [2024-09-13 10:25:47,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bdb08bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:25:47, skipping insertion in model container [2024-09-13 10:25:47,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:25:47" (2/2) ... [2024-09-13 10:25:47,810 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 10:25:47,810 INFO L1541 ArrayList]: Loop invariant at [L34-L45] ((((((((((((z + ((__int128) y * x)) == ((long long) b * a)) && (b <= 5)) && (((long long) a * 2) == x)) && (0 <= a)) && (1 <= b)) && (a <= 5)) && (((-1 + b) / 2) == y)) || ((((((z == ((long long) b * a)) && (b <= 5)) && (0 <= a)) && (1 <= b)) && (y == 0)) && (a <= 5))) || (((((((z == 0) && (b == y)) && (0 <= a)) && (1 <= y)) && (a <= 5)) && (a == x)) && (y <= 5))) || ((((((y == 1) && (b <= 5)) && ((z + x) == ((long long) b * a))) && (0 <= a)) && (1 <= b)) && (a <= 5))) || ((((((((z == 0) && (y == (b / 2))) && (b <= 5)) && (((long long) a * 2) == x)) && (0 <= a)) && ((b % 2) != 1)) && (1 <= y)) && (a <= 5))) [2024-09-13 10:25:47,810 INFO L1541 ArrayList]: Function contract at [L9]: requires null, ensures (\old(cond) != 0) [2024-09-13 10:25:47,811 INFO L1541 ArrayList]: Function contract at [L12]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-13 10:25:47,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 10:25:47,960 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound5.c[537,550] [2024-09-13 10:25:47,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:25:47,983 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 10:25:48,025 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound5.c[537,550] Start Parsing Local [2024-09-13 10:25:48,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:25:48,060 INFO L204 MainTranslator]: Completed translation [2024-09-13 10:25:48,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:25:48 WrapperNode [2024-09-13 10:25:48,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 10:25:48,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 10:25:48,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 10:25:48,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 10:25:48,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:25:48" (1/1) ... [2024-09-13 10:25:48,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:25:48" (1/1) ... [2024-09-13 10:25:48,109 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2024-09-13 10:25:48,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 10:25:48,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 10:25:48,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 10:25:48,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 10:25:48,122 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:25:48" (1/1) ... [2024-09-13 10:25:48,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:25:48" (1/1) ... [2024-09-13 10:25:48,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:25:48" (1/1) ... [2024-09-13 10:25:48,129 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure assume_abort_if_not is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-13 10:25:48,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:25:48" (1/1) ... [2024-09-13 10:25:48,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:25:48" (1/1) ... [2024-09-13 10:25:48,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:25:48" (1/1) ... [2024-09-13 10:25:48,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:25:48" (1/1) ... [2024-09-13 10:25:48,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:25:48" (1/1) ... [2024-09-13 10:25:48,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:25:48" (1/1) ... [2024-09-13 10:25:48,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 10:25:48,144 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 10:25:48,144 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 10:25:48,144 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 10:25:48,145 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:25:48" (1/1) ... [2024-09-13 10:25:48,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:25:48,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:25:48,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 10:25:48,174 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 10:25:48,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 10:25:48,213 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 10:25:48,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 10:25:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 10:25:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 10:25:48,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 10:25:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 10:25:48,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 10:25:48,265 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 10:25:48,267 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 10:25:48,425 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 10:25:48,448 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-13 10:25:48,449 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 10:25:48,491 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 10:25:48,491 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 10:25:48,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:25:48 BoogieIcfgContainer [2024-09-13 10:25:48,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 10:25:48,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 10:25:48,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 10:25:48,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 10:25:48,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:25:46" (1/4) ... [2024-09-13 10:25:48,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3fbcab and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 10:25:48, skipping insertion in model container [2024-09-13 10:25:48,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 10:25:47" (2/4) ... [2024-09-13 10:25:48,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3fbcab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:25:48, skipping insertion in model container [2024-09-13 10:25:48,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:25:48" (3/4) ... [2024-09-13 10:25:48,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3fbcab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:25:48, skipping insertion in model container [2024-09-13 10:25:48,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:25:48" (4/4) ... [2024-09-13 10:25:48,518 INFO L112 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound5.c [2024-09-13 10:25:48,538 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 10:25:48,538 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-09-13 10:25:48,598 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 10:25:48,606 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;@246f8fd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 10:25:48,606 INFO L337 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-09-13 10:25:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 22 states have internal predecessors, (28), 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-13 10:25:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 10:25:48,614 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:25:48,615 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 10:25:48,615 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-13 10:25:48,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:25:48,622 INFO L85 PathProgramCache]: Analyzing trace with hash 99841657, now seen corresponding path program 1 times [2024-09-13 10:25:48,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:25:48,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98595796] [2024-09-13 10:25:48,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:25:48,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:25:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:25:48,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:25:48,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98595796] [2024-09-13 10:25:48,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98595796] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:25:48,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:25:48,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:25:48,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770515012] [2024-09-13 10:25:48,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:25:48,760 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 10:25:48,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:25:48,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 10:25:48,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 10:25:48,788 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 22 states have internal predecessors, (28), 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:25:48,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:25:48,808 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-09-13 10:25:48,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 10:25:48,810 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-13 10:25:48,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:25:48,816 INFO L225 Difference]: With dead ends: 30 [2024-09-13 10:25:48,816 INFO L226 Difference]: Without dead ends: 28 [2024-09-13 10:25:48,817 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 10:25:48,821 INFO L434 NwaCegarLoop]: 31 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, 31 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:25:48,822 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:25:48,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-13 10:25:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-13 10:25:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.3529411764705883) 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-13 10:25:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-09-13 10:25:48,854 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 5 [2024-09-13 10:25:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:25:48,855 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-09-13 10:25:48,855 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:25:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-09-13 10:25:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 10:25:48,857 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:25:48,857 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 10:25:48,857 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 10:25:48,859 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-13 10:25:48,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:25:48,860 INFO L85 PathProgramCache]: Analyzing trace with hash 99841719, now seen corresponding path program 1 times [2024-09-13 10:25:48,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:25:48,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126965992] [2024-09-13 10:25:48,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:25:48,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:25:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:25:48,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:25:48,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126965992] [2024-09-13 10:25:48,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126965992] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:25:48,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:25:48,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:25:48,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522222165] [2024-09-13 10:25:48,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:25:48,989 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:25:48,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:25:48,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:25:48,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:25:48,990 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:25:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:25:49,038 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-09-13 10:25:49,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:25:49,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-13 10:25:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:25:49,041 INFO L225 Difference]: With dead ends: 27 [2024-09-13 10:25:49,041 INFO L226 Difference]: Without dead ends: 27 [2024-09-13 10:25:49,041 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:25:49,042 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:25:49,042 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:25:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-13 10:25:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-13 10:25:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 20 states have internal predecessors, (22), 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-13 10:25:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-13 10:25:49,051 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2024-09-13 10:25:49,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:25:49,052 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-13 10:25:49,052 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:25:49,052 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-13 10:25:49,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 10:25:49,054 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:25:49,054 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:25:49,054 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 10:25:49,054 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-13 10:25:49,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:25:49,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1683842591, now seen corresponding path program 1 times [2024-09-13 10:25:49,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:25:49,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767553484] [2024-09-13 10:25:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:25:49,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:25:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:49,602 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:25:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:49,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:25:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:49,669 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:25:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 10:25:49,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:25:49,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767553484] [2024-09-13 10:25:49,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767553484] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:25:49,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:25:49,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-13 10:25:49,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662485584] [2024-09-13 10:25:49,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:25:49,704 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-13 10:25:49,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:25:49,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-13 10:25:49,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-13 10:25:49,706 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 9 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 10:25:49,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:25:49,899 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-09-13 10:25:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 10:25:49,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2024-09-13 10:25:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:25:49,901 INFO L225 Difference]: With dead ends: 33 [2024-09-13 10:25:49,901 INFO L226 Difference]: Without dead ends: 33 [2024-09-13 10:25:49,901 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-09-13 10:25:49,902 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:25:49,903 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 74 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:25:49,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-13 10:25:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-09-13 10:25:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 10:25:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-09-13 10:25:49,910 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 19 [2024-09-13 10:25:49,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:25:49,911 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-09-13 10:25:49,912 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 10:25:49,912 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-09-13 10:25:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 10:25:49,913 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:25:49,913 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:25:49,913 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 10:25:49,913 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 10:25:49,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:25:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash 332140251, now seen corresponding path program 1 times [2024-09-13 10:25:49,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:25:49,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791613163] [2024-09-13 10:25:49,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:25:49,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:25:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:49,971 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:25:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:49,976 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:25:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:49,979 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:25:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 10:25:49,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:25:49,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791613163] [2024-09-13 10:25:49,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791613163] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:25:49,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:25:49,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:25:49,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485256741] [2024-09-13 10:25:49,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:25:49,985 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:25:49,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:25:49,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:25:49,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:25:49,986 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:25:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:25:49,995 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-09-13 10:25:49,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:25:49,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 10:25:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:25:49,998 INFO L225 Difference]: With dead ends: 29 [2024-09-13 10:25:49,998 INFO L226 Difference]: Without dead ends: 29 [2024-09-13 10:25:49,998 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:25:49,999 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:25:49,999 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:25:50,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-13 10:25:50,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-13 10:25:50,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 10:25:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-09-13 10:25:50,005 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 24 [2024-09-13 10:25:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:25:50,005 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-09-13 10:25:50,005 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:25:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-09-13 10:25:50,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 10:25:50,006 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:25:50,006 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:25:50,006 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 10:25:50,006 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 10:25:50,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:25:50,007 INFO L85 PathProgramCache]: Analyzing trace with hash 332140412, now seen corresponding path program 1 times [2024-09-13 10:25:50,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:25:50,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537775598] [2024-09-13 10:25:50,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:25:50,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:25:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:50,050 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:25:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:50,053 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:25:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:50,058 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:25:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 10:25:50,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:25:50,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537775598] [2024-09-13 10:25:50,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537775598] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:25:50,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:25:50,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:25:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885865491] [2024-09-13 10:25:50,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:25:50,064 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:25:50,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:25:50,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:25:50,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:25:50,065 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:25:50,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:25:50,081 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-09-13 10:25:50,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:25:50,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 10:25:50,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:25:50,084 INFO L225 Difference]: With dead ends: 28 [2024-09-13 10:25:50,084 INFO L226 Difference]: Without dead ends: 28 [2024-09-13 10:25:50,085 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:25:50,087 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 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-13 10:25:50,088 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:25:50,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-13 10:25:50,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-13 10:25:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 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-13 10:25:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-09-13 10:25:50,092 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 24 [2024-09-13 10:25:50,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:25:50,093 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-09-13 10:25:50,093 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:25:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-09-13 10:25:50,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-13 10:25:50,094 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:25:50,094 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:25:50,094 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 10:25:50,094 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 10:25:50,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:25:50,095 INFO L85 PathProgramCache]: Analyzing trace with hash -633490312, now seen corresponding path program 1 times [2024-09-13 10:25:50,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:25:50,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880666847] [2024-09-13 10:25:50,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:25:50,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:25:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:25:50,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [351101811] [2024-09-13 10:25:50,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:25:50,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:25:50,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:25:50,148 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:25:50,150 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 10:25:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:50,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-13 10:25:50,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:25:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 10:25:50,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:25:52,425 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 10:25:52,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:25:52,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880666847] [2024-09-13 10:25:52,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:25:52,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351101811] [2024-09-13 10:25:52,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351101811] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:25:52,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 10:25:52,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2024-09-13 10:25:52,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874387877] [2024-09-13 10:25:52,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 10:25:52,427 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-13 10:25:52,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:25:52,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-13 10:25:52,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-09-13 10:25:52,429 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-13 10:25:52,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:25:52,756 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-09-13 10:25:52,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-13 10:25:52,757 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 29 [2024-09-13 10:25:52,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:25:52,758 INFO L225 Difference]: With dead ends: 38 [2024-09-13 10:25:52,758 INFO L226 Difference]: Without dead ends: 38 [2024-09-13 10:25:52,758 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-09-13 10:25:52,759 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:25:52,759 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 127 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:25:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-13 10:25:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2024-09-13 10:25:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 10:25:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-09-13 10:25:52,766 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 29 [2024-09-13 10:25:52,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:25:52,768 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-09-13 10:25:52,769 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 12 states have internal predecessors, (22), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-13 10:25:52,769 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-09-13 10:25:52,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-13 10:25:52,770 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:25:52,770 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:25:52,788 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 10:25:52,970 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-13 10:25:52,971 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-13 10:25:52,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:25:52,972 INFO L85 PathProgramCache]: Analyzing trace with hash -633488390, now seen corresponding path program 1 times [2024-09-13 10:25:52,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:25:52,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531262709] [2024-09-13 10:25:52,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:25:52,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:25:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:54,434 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 10:25:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:54,437 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 10:25:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:54,440 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 10:25:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:54,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:25:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 10:25:54,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:25:54,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531262709] [2024-09-13 10:25:54,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531262709] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:25:54,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968856039] [2024-09-13 10:25:54,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:25:54,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:25:54,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:25:54,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:25:54,492 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 10:25:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:54,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-13 10:25:54,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:25:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 10:25:54,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:25:55,610 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 10:25:55,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968856039] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:25:55,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:25:55,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2024-09-13 10:25:55,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790756126] [2024-09-13 10:25:55,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:25:55,611 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-13 10:25:55,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:25:55,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-13 10:25:55,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-09-13 10:25:55,614 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-13 10:25:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:25:55,804 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2024-09-13 10:25:55,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 10:25:55,805 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2024-09-13 10:25:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:25:55,806 INFO L225 Difference]: With dead ends: 46 [2024-09-13 10:25:55,806 INFO L226 Difference]: Without dead ends: 46 [2024-09-13 10:25:55,807 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-09-13 10:25:55,807 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:25:55,807 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 90 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:25:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-13 10:25:55,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-09-13 10:25:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 35 states have internal predecessors, (42), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 10:25:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2024-09-13 10:25:55,812 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 29 [2024-09-13 10:25:55,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:25:55,813 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2024-09-13 10:25:55,813 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-13 10:25:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2024-09-13 10:25:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 10:25:55,814 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:25:55,814 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:25:55,830 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-13 10:25:56,017 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-13 10:25:56,018 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-13 10:25:56,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:25:56,018 INFO L85 PathProgramCache]: Analyzing trace with hash -885297805, now seen corresponding path program 1 times [2024-09-13 10:25:56,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:25:56,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928885273] [2024-09-13 10:25:56,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:25:56,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:25:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:25:56,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [138955929] [2024-09-13 10:25:56,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:25:56,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:25:56,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:25:56,041 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:25:56,048 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 10:25:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:56,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-13 10:25:56,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:25:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-13 10:25:56,653 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 10:25:56,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:25:56,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928885273] [2024-09-13 10:25:56,654 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:25:56,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138955929] [2024-09-13 10:25:56,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138955929] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:25:56,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:25:56,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:25:56,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254070295] [2024-09-13 10:25:56,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:25:56,654 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:25:56,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:25:56,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:25:56,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:25:56,655 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 10:25:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:25:56,714 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2024-09-13 10:25:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:25:56,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-09-13 10:25:56,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:25:56,715 INFO L225 Difference]: With dead ends: 45 [2024-09-13 10:25:56,715 INFO L226 Difference]: Without dead ends: 44 [2024-09-13 10:25:56,716 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:25:56,716 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:25:56,717 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 45 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:25:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-13 10:25:56,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-09-13 10:25:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 10:25:56,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2024-09-13 10:25:56,721 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 37 [2024-09-13 10:25:56,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:25:56,721 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-09-13 10:25:56,722 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 10:25:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-09-13 10:25:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-13 10:25:56,723 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:25:56,723 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:25:56,735 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-13 10:25:56,923 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-13 10:25:56,923 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 10:25:56,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:25:56,924 INFO L85 PathProgramCache]: Analyzing trace with hash -367614063, now seen corresponding path program 2 times [2024-09-13 10:25:56,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:25:56,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479395523] [2024-09-13 10:25:56,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:25:56,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:25:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:25:56,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1209240473] [2024-09-13 10:25:56,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 10:25:56,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:25:56,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:25:56,977 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:25:56,979 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 10:25:57,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 10:25:57,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 10:25:57,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-13 10:25:57,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:25:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-13 10:25:57,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:25:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-13 10:25:58,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:25:58,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479395523] [2024-09-13 10:25:58,607 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:25:58,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209240473] [2024-09-13 10:25:58,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209240473] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 10:25:58,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 10:25:58,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2024-09-13 10:25:58,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956714173] [2024-09-13 10:25:58,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:25:58,608 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 10:25:58,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:25:58,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 10:25:58,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-09-13 10:25:58,608 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-13 10:25:58,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:25:58,733 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2024-09-13 10:25:58,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 10:25:58,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2024-09-13 10:25:58,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:25:58,734 INFO L225 Difference]: With dead ends: 48 [2024-09-13 10:25:58,734 INFO L226 Difference]: Without dead ends: 43 [2024-09-13 10:25:58,734 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-09-13 10:25:58,735 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:25:58,735 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 66 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:25:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-13 10:25:58,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-13 10:25:58,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 10:25:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2024-09-13 10:25:58,740 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 39 [2024-09-13 10:25:58,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:25:58,740 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-09-13 10:25:58,740 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-13 10:25:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-09-13 10:25:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-13 10:25:58,741 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:25:58,742 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:25:58,756 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 10:25:58,945 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:25:58,946 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 10:25:58,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:25:58,946 INFO L85 PathProgramCache]: Analyzing trace with hash -367612141, now seen corresponding path program 1 times [2024-09-13 10:25:58,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:25:58,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364715657] [2024-09-13 10:25:58,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:25:58,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:25:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 10:25:58,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2097233845] [2024-09-13 10:25:58,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:25:58,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:25:58,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:25:58,972 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:25:58,982 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 10:25:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:25:59,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-13 10:25:59,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:26:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-13 10:26:01,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:26:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-13 10:26:01,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:26:01,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364715657] [2024-09-13 10:26:01,791 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 10:26:01,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097233845] [2024-09-13 10:26:01,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097233845] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:26:01,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 10:26:01,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2024-09-13 10:26:01,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503447987] [2024-09-13 10:26:01,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 10:26:01,792 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-13 10:26:01,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:26:01,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-13 10:26:01,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-09-13 10:26:01,793 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 5 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-09-13 10:26:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:26:02,194 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-09-13 10:26:02,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-13 10:26:02,195 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 5 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 39 [2024-09-13 10:26:02,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:26:02,195 INFO L225 Difference]: With dead ends: 44 [2024-09-13 10:26:02,195 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 10:26:02,196 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2024-09-13 10:26:02,196 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 10:26:02,196 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 131 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 10:26:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 10:26:02,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 10:26:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:26:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 10:26:02,197 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2024-09-13 10:26:02,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:26:02,197 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 10:26:02,198 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 5 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-09-13 10:26:02,198 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 10:26:02,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 10:26:02,200 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-09-13 10:26:02,201 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (4 of 6 remaining) [2024-09-13 10:26:02,201 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (3 of 6 remaining) [2024-09-13 10:26:02,201 INFO L785 garLoopResultBuilder]: Registering result SAFE for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 6 remaining) [2024-09-13 10:26:02,201 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-09-13 10:26:02,201 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 6 remaining) [2024-09-13 10:26:02,218 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-13 10:26:02,405 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-13 10:26:02,408 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:26:02,410 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 10:26:02,411 INFO L469 ceAbstractionStarter]: Automizer considered 1 witness invariants [2024-09-13 10:26:02,411 INFO L470 ceAbstractionStarter]: WitnessConsidered=1 [2024-09-13 10:26:02,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 10:26:02 BoogieIcfgContainer [2024-09-13 10:26:02,412 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 10:26:02,413 INFO L158 Benchmark]: Toolchain (without parser) took 14624.71ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 115.5MB in the beginning and 103.5MB in the end (delta: 11.9MB). Peak memory consumption was 179.0MB. Max. memory is 16.1GB. [2024-09-13 10:26:02,413 INFO L158 Benchmark]: Witness Parser took 0.19ms. Allocated memory is still 98.6MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:26:02,413 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 98.6MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:26:02,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.58ms. Allocated memory is still 151.0MB. Free memory was 114.7MB in the beginning and 101.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 10:26:02,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.80ms. Allocated memory is still 151.0MB. Free memory was 100.8MB in the beginning and 99.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:26:02,413 INFO L158 Benchmark]: Boogie Preprocessor took 33.61ms. Allocated memory is still 151.0MB. Free memory was 99.4MB in the beginning and 97.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 10:26:02,414 INFO L158 Benchmark]: RCFGBuilder took 350.83ms. Allocated memory is still 151.0MB. Free memory was 97.9MB in the beginning and 122.6MB in the end (delta: -24.6MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-09-13 10:26:02,414 INFO L158 Benchmark]: TraceAbstraction took 13915.69ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 122.6MB in the beginning and 103.5MB in the end (delta: 19.0MB). Peak memory consumption was 186.8MB. Max. memory is 16.1GB. [2024-09-13 10:26:02,415 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.19ms. Allocated memory is still 98.6MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.11ms. Allocated memory is still 98.6MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.58ms. Allocated memory is still 151.0MB. Free memory was 114.7MB in the beginning and 101.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.80ms. Allocated memory is still 151.0MB. Free memory was 100.8MB in the beginning and 99.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.61ms. Allocated memory is still 151.0MB. Free memory was 99.4MB in the beginning and 97.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 350.83ms. Allocated memory is still 151.0MB. Free memory was 97.9MB in the beginning and 122.6MB in the end (delta: -24.6MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13915.69ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 122.6MB in the beginning and 103.5MB in the end (delta: 19.0MB). Peak memory consumption was 186.8MB. 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: 34]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 12]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 12]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 9]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 15]: 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: 12]: 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: 13.8s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 725 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 503 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 641 IncrementalHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 222 mSDtfsCounter, 641 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 283 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=7, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 4063 SizeOfPredicates, 15 NumberOfNonLiveVariables, 476 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 189/217 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-13 10:26:02,441 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...