This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 13:30:15,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 13:30:15,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 13:30:15,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 13:30:15,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 13:30:15,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 13:30:15,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 13:30:15,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 13:30:15,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 13:30:15,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 13:30:15,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 13:30:15,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 13:30:15,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 13:30:15,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 13:30:15,258 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 13:30:15,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 13:30:15,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 13:30:15,259 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 13:30:15,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 13:30:15,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 13:30:15,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 13:30:15,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 13:30:15,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 13:30:15,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 13:30:15,265 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 13:30:15,265 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 13:30:15,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 13:30:15,266 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 13:30:15,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 13:30:15,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 13:30:15,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 13:30:15,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 13:30:15,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:30:15,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 13:30:15,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 13:30:15,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 13:30:15,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 13:30:15,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 13:30:15,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 13:30:15,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 13:30:15,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 13:30:15,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 13:30:15,273 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-20 13:30:15,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 13:30:15,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 13:30:15,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 13:30:15,551 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-20 13:30:15,552 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-20 13:30:15,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/diamond_1-1.yml/witness-2.1.yml [2024-09-20 13:30:15,605 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 13:30:15,605 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 13:30:15,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-acceleration/diamond_1-1.c [2024-09-20 13:30:17,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 13:30:17,263 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 13:30:17,264 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-acceleration/diamond_1-1.c [2024-09-20 13:30:17,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/b04e86501/cc5932c85aac4a1e9b2ceb6a840c4eea/FLAGbcfae35a1 [2024-09-20 13:30:17,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/b04e86501/cc5932c85aac4a1e9b2ceb6a840c4eea [2024-09-20 13:30:17,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 13:30:17,291 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-20 13:30:17,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 13:30:17,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 13:30:17,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 13:30:17,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:30:15" (1/2) ... [2024-09-20 13:30:17,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a78e71 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:17, skipping insertion in model container [2024-09-20 13:30:17,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:30:15" (1/2) ... [2024-09-20 13:30:17,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@288b39a2 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:17, skipping insertion in model container [2024-09-20 13:30:17,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:30:17" (2/2) ... [2024-09-20 13:30:17,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a78e71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:17, skipping insertion in model container [2024-09-20 13:30:17,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:30:17" (2/2) ... [2024-09-20 13:30:17,313 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-20 13:30:17,313 INFO L1541 ArrayList]: Loop invariant at [L17-L23] ((((x == 0) || (((y % 2) == 0) && ((x % 2) == 0))) || ((((x + 4294967295) % 4294967296) <= 98) && ((x % 2) == 0))) || ((((x + 4294967295) % 4294967296) <= 98) && ((x % 2) == (y % 2)))) [2024-09-20 13:30:17,314 INFO L1541 ArrayList]: Function contract at [L6]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-20 13:30:17,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 13:30:17,478 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-acceleration/diamond_1-1.c[373,386] [2024-09-20 13:30:17,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:30:17,497 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global [2024-09-20 13:30:17,532 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-acceleration/diamond_1-1.c[373,386] Start Parsing Local [2024-09-20 13:30:17,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:30:17,558 INFO L204 MainTranslator]: Completed translation [2024-09-20 13:30:17,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:17 WrapperNode [2024-09-20 13:30:17,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 13:30:17,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 13:30:17,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 13:30:17,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 13:30:17,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:17" (1/1) ... [2024-09-20 13:30:17,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:17" (1/1) ... [2024-09-20 13:30:17,595 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 29 [2024-09-20 13:30:17,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 13:30:17,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 13:30:17,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 13:30:17,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 13:30:17,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:17" (1/1) ... [2024-09-20 13:30:17,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:17" (1/1) ... [2024-09-20 13:30:17,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:17" (1/1) ... [2024-09-20 13:30:17,632 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-20 13:30:17,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:17" (1/1) ... [2024-09-20 13:30:17,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:17" (1/1) ... [2024-09-20 13:30:17,635 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:17" (1/1) ... [2024-09-20 13:30:17,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:17" (1/1) ... [2024-09-20 13:30:17,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:17" (1/1) ... [2024-09-20 13:30:17,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:17" (1/1) ... [2024-09-20 13:30:17,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 13:30:17,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 13:30:17,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 13:30:17,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 13:30:17,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:17" (1/1) ... [2024-09-20 13:30:17,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:30:17,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:30:17,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-20 13:30:17,675 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-20 13:30:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 13:30:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 13:30:17,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 13:30:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 13:30:17,782 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 13:30:17,784 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 13:30:17,913 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-20 13:30:17,913 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 13:30:17,939 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 13:30:17,940 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 13:30:17,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:30:17 BoogieIcfgContainer [2024-09-20 13:30:17,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 13:30:17,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 13:30:17,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 13:30:17,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 13:30:17,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:30:15" (1/4) ... [2024-09-20 13:30:17,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0bd32a and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.09 01:30:17, skipping insertion in model container [2024-09-20 13:30:17,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:30:17" (2/4) ... [2024-09-20 13:30:17,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0bd32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:30:17, skipping insertion in model container [2024-09-20 13:30:17,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:17" (3/4) ... [2024-09-20 13:30:17,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0bd32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:30:17, skipping insertion in model container [2024-09-20 13:30:17,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:30:17" (4/4) ... [2024-09-20 13:30:17,949 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_1-1.c [2024-09-20 13:30:17,968 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 13:30:17,968 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-09-20 13:30:18,015 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 13:30:18,022 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;@6e04329d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 13:30:18,023 INFO L337 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-09-20 13:30:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-09-20 13:30:18,033 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:18,033 INFO L216 NwaCegarLoop]: trace histogram [1, 1] [2024-09-20 13:30:18,034 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-20 13:30:18,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2267, now seen corresponding path program 1 times [2024-09-20 13:30:18,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:18,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513059421] [2024-09-20 13:30:18,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:18,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:30:18,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:18,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513059421] [2024-09-20 13:30:18,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513059421] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:18,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:18,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-20 13:30:18,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709494037] [2024-09-20 13:30:18,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:18,319 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:30:18,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:18,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:30:18,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:30:18,351 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 13 states have internal predecessors, (17), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:18,406 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2024-09-20 13:30:18,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:30:18,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-09-20 13:30:18,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:18,418 INFO L225 Difference]: With dead ends: 17 [2024-09-20 13:30:18,418 INFO L226 Difference]: Without dead ends: 16 [2024-09-20 13:30:18,420 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:30:18,423 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:18,426 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 15 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:30:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-20 13:30:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-09-20 13:30:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-09-20 13:30:18,453 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 2 [2024-09-20 13:30:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:18,453 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-09-20 13:30:18,453 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-09-20 13:30:18,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-20 13:30:18,454 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:18,454 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-20 13:30:18,454 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 13:30:18,455 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-20 13:30:18,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash 67578981, now seen corresponding path program 1 times [2024-09-20 13:30:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:18,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377144463] [2024-09-20 13:30:18,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:18,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:30:18,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:18,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377144463] [2024-09-20 13:30:18,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377144463] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:30:18,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052939888] [2024-09-20 13:30:18,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:18,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:30:18,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:30:18,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:30:18,668 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-20 13:30:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:18,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-20 13:30:18,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:30:18,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:30:18,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:30:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:30:18,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052939888] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-20 13:30:18,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-20 13:30:18,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2024-09-20 13:30:18,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370118993] [2024-09-20 13:30:18,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:18,919 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 13:30:18,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:18,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 13:30:18,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-20 13:30:18,920 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:18,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:18,958 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2024-09-20 13:30:18,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 13:30:18,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-20 13:30:18,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:18,960 INFO L225 Difference]: With dead ends: 20 [2024-09-20 13:30:18,960 INFO L226 Difference]: Without dead ends: 20 [2024-09-20 13:30:18,960 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-20 13:30:18,962 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:18,963 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 19 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:30:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-20 13:30:18,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-09-20 13:30:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-09-20 13:30:18,967 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 5 [2024-09-20 13:30:18,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:18,967 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-09-20 13:30:18,970 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-09-20 13:30:18,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-20 13:30:18,971 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:18,971 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-20 13:30:18,987 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 13:30:19,174 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:30:19,174 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-20 13:30:19,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:19,175 INFO L85 PathProgramCache]: Analyzing trace with hash 67579043, now seen corresponding path program 1 times [2024-09-20 13:30:19,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:19,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547942468] [2024-09-20 13:30:19,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:19,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:19,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:30:19,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:19,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547942468] [2024-09-20 13:30:19,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547942468] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:30:19,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030623120] [2024-09-20 13:30:19,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:19,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:30:19,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:30:19,396 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:30:19,399 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-20 13:30:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:19,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-20 13:30:19,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:30:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:30:19,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:30:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:30:19,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030623120] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:30:19,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 13:30:19,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-09-20 13:30:19,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822410640] [2024-09-20 13:30:19,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 13:30:19,678 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 13:30:19,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:19,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 13:30:19,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-20 13:30:19,679 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:19,931 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-09-20 13:30:19,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 13:30:19,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-20 13:30:19,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:19,932 INFO L225 Difference]: With dead ends: 31 [2024-09-20 13:30:19,933 INFO L226 Difference]: Without dead ends: 31 [2024-09-20 13:30:19,933 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-20 13:30:19,934 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:19,934 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 27 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:30:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-20 13:30:19,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-09-20 13:30:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-09-20 13:30:19,939 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 5 [2024-09-20 13:30:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:19,939 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-09-20 13:30:19,939 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-09-20 13:30:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-20 13:30:19,940 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:19,940 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-09-20 13:30:19,957 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-20 13:30:20,144 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:30:20,145 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-20 13:30:20,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:20,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1606726160, now seen corresponding path program 1 times [2024-09-20 13:30:20,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:20,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430124568] [2024-09-20 13:30:20,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:20,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:30:20,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:20,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430124568] [2024-09-20 13:30:20,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430124568] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:30:20,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107224622] [2024-09-20 13:30:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:20,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:30:20,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:30:20,260 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:30:20,261 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-20 13:30:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:20,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-20 13:30:20,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:30:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-20 13:30:20,419 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 13:30:20,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107224622] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:20,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 13:30:20,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2024-09-20 13:30:20,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034319252] [2024-09-20 13:30:20,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:20,421 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 13:30:20,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:20,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 13:30:20,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-09-20 13:30:20,422 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:20,463 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-09-20 13:30:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 13:30:20,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-09-20 13:30:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:20,464 INFO L225 Difference]: With dead ends: 31 [2024-09-20 13:30:20,464 INFO L226 Difference]: Without dead ends: 30 [2024-09-20 13:30:20,465 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-09-20 13:30:20,465 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:20,466 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 18 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:30:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-20 13:30:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-09-20 13:30:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.25) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-09-20 13:30:20,472 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 11 [2024-09-20 13:30:20,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:20,472 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-09-20 13:30:20,472 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-09-20 13:30:20,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-20 13:30:20,473 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:20,473 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1] [2024-09-20 13:30:20,487 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-20 13:30:20,677 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:30:20,678 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-20 13:30:20,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:20,678 INFO L85 PathProgramCache]: Analyzing trace with hash 799228261, now seen corresponding path program 1 times [2024-09-20 13:30:20,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:20,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11259329] [2024-09-20 13:30:20,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:20,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-20 13:30:20,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:20,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11259329] [2024-09-20 13:30:20,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11259329] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:20,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:20,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:30:20,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165458171] [2024-09-20 13:30:20,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:20,718 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:30:20,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:20,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:30:20,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:30:20,719 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:20,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:20,735 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-09-20 13:30:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:30:20,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-09-20 13:30:20,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:20,736 INFO L225 Difference]: With dead ends: 25 [2024-09-20 13:30:20,736 INFO L226 Difference]: Without dead ends: 25 [2024-09-20 13:30:20,736 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:30:20,737 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:20,737 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:30:20,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-20 13:30:20,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-09-20 13:30:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:20,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-09-20 13:30:20,741 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 11 [2024-09-20 13:30:20,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:20,742 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-09-20 13:30:20,742 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:20,742 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-09-20 13:30:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-20 13:30:20,743 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:20,743 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:20,743 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 13:30:20,743 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-20 13:30:20,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:20,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2124384941, now seen corresponding path program 1 times [2024-09-20 13:30:20,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:20,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454044889] [2024-09-20 13:30:20,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:20,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-20 13:30:20,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:20,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454044889] [2024-09-20 13:30:20,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454044889] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:20,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:20,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:30:20,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119869310] [2024-09-20 13:30:20,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:20,808 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:30:20,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:20,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:30:20,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:30:20,810 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:20,813 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-09-20 13:30:20,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:30:20,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-09-20 13:30:20,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:20,814 INFO L225 Difference]: With dead ends: 23 [2024-09-20 13:30:20,814 INFO L226 Difference]: Without dead ends: 15 [2024-09-20 13:30:20,815 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:30:20,815 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:20,816 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:30:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-09-20 13:30:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-09-20 13:30:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-09-20 13:30:20,819 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2024-09-20 13:30:20,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:20,819 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-09-20 13:30:20,819 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:20,819 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-09-20 13:30:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-20 13:30:20,820 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:20,820 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-09-20 13:30:20,820 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 13:30:20,821 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-20 13:30:20,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:20,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1487677432, now seen corresponding path program 1 times [2024-09-20 13:30:20,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:20,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173258700] [2024-09-20 13:30:20,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:20,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:30:20,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:20,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173258700] [2024-09-20 13:30:20,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173258700] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:30:20,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329563535] [2024-09-20 13:30:20,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:20,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:30:20,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:30:20,931 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-20 13:30:20,932 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-20 13:30:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:20,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-20 13:30:20,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:30:21,061 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:30:21,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:30:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 13:30:21,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329563535] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-20 13:30:21,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-20 13:30:21,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 12 [2024-09-20 13:30:21,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921794143] [2024-09-20 13:30:21,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:21,164 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 13:30:21,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:21,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 13:30:21,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-09-20 13:30:21,165 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:21,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:21,186 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-09-20 13:30:21,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 13:30:21,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-09-20 13:30:21,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:21,187 INFO L225 Difference]: With dead ends: 14 [2024-09-20 13:30:21,187 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 13:30:21,187 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-09-20 13:30:21,188 INFO L434 NwaCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:21,188 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:30:21,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 13:30:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 13:30:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 13:30:21,190 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2024-09-20 13:30:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:21,190 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 13:30:21,190 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 13:30:21,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 13:30:21,193 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-09-20 13:30:21,194 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITION (2 of 4 remaining) [2024-09-20 13:30:21,194 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-09-20 13:30:21,194 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONPOST_CONDITION (0 of 4 remaining) [2024-09-20 13:30:21,210 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-20 13:30:21,394 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:30:21,397 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:21,399 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 13:30:21,401 INFO L469 ceAbstractionStarter]: Automizer considered 1 witness invariants [2024-09-20 13:30:21,401 INFO L470 ceAbstractionStarter]: WitnessConsidered=1 [2024-09-20 13:30:21,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:30:21 BoogieIcfgContainer [2024-09-20 13:30:21,402 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 13:30:21,403 INFO L158 Benchmark]: Toolchain (without parser) took 4112.32ms. Allocated memory was 174.1MB in the beginning and 247.5MB in the end (delta: 73.4MB). Free memory was 119.2MB in the beginning and 162.9MB in the end (delta: -43.7MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2024-09-20 13:30:21,403 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 174.1MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:30:21,403 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 174.1MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:30:21,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.64ms. Allocated memory is still 174.1MB. Free memory was 118.7MB in the beginning and 105.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 13:30:21,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.61ms. Allocated memory is still 174.1MB. Free memory was 105.7MB in the beginning and 104.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 13:30:21,404 INFO L158 Benchmark]: Boogie Preprocessor took 43.48ms. Allocated memory is still 174.1MB. Free memory was 104.0MB in the beginning and 102.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:30:21,404 INFO L158 Benchmark]: RCFGBuilder took 296.93ms. Allocated memory is still 174.1MB. Free memory was 102.4MB in the beginning and 90.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 13:30:21,406 INFO L158 Benchmark]: TraceAbstraction took 3460.04ms. Allocated memory was 174.1MB in the beginning and 247.5MB in the end (delta: 73.4MB). Free memory was 89.3MB in the beginning and 162.9MB in the end (delta: -73.6MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2024-09-20 13:30:21,410 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.21ms. Allocated memory is still 174.1MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.88ms. Allocated memory is still 174.1MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.64ms. Allocated memory is still 174.1MB. Free memory was 118.7MB in the beginning and 105.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.61ms. Allocated memory is still 174.1MB. Free memory was 105.7MB in the beginning and 104.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.48ms. Allocated memory is still 174.1MB. Free memory was 104.0MB in the beginning and 102.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 296.93ms. Allocated memory is still 174.1MB. Free memory was 102.4MB in the beginning and 90.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3460.04ms. Allocated memory was 174.1MB in the beginning and 247.5MB in the end (delta: 73.4MB). Free memory was 89.3MB in the beginning and 162.9MB in the end (delta: -73.6MB). Peak memory consumption was 2.3MB. 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: 17]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 6]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 8]: 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: 6]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 112 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 144 IncrementalHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 53 mSDtfsCounter, 144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=3, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 469 SizeOfPredicates, 2 NumberOfNonLiveVariables, 148 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 42/84 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-20 13:30:21,431 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...