This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 13:45:50,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 13:45:50,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 13:45:50,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 13:45:50,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 13:45:50,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 13:45:50,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 13:45:50,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 13:45:50,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 13:45:50,172 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 13:45:50,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 13:45:50,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 13:45:50,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 13:45:50,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 13:45:50,175 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 13:45:50,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 13:45:50,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 13:45:50,177 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 13:45:50,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 13:45:50,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 13:45:50,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 13:45:50,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 13:45:50,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 13:45:50,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 13:45:50,182 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 13:45:50,182 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 13:45:50,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 13:45:50,183 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 13:45:50,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 13:45:50,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 13:45:50,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 13:45:50,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 13:45:50,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:45:50,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 13:45:50,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 13:45:50,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 13:45:50,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 13:45:50,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 13:45:50,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 13:45:50,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 13:45:50,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 13:45:50,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 13:45:50,189 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:45:50,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 13:45:50,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 13:45:50,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 13:45:50,500 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-20 13:45:50,501 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-20 13:45:50,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/id2_b5_o10.yml/witness-2.1.yml [2024-09-20 13:45:50,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 13:45:50,552 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 13:45:50,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/id2_b5_o10.c [2024-09-20 13:45:51,971 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 13:45:52,150 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 13:45:52,151 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_b5_o10.c [2024-09-20 13:45:52,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/eafbd2bef/88d137fa323b423b92dd11b4112e2a42/FLAGa7643c84e [2024-09-20 13:45:52,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/eafbd2bef/88d137fa323b423b92dd11b4112e2a42 [2024-09-20 13:45:52,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 13:45:52,175 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-20 13:45:52,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 13:45:52,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 13:45:52,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 13:45:52,183 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:45:50" (1/2) ... [2024-09-20 13:45:52,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506b687 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:45:52, skipping insertion in model container [2024-09-20 13:45:52,184 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:45:50" (1/2) ... [2024-09-20 13:45:52,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4ce9e1cb and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:45:52, skipping insertion in model container [2024-09-20 13:45:52,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:45:52" (2/2) ... [2024-09-20 13:45:52,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506b687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:52, skipping insertion in model container [2024-09-20 13:45:52,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:45:52" (2/2) ... [2024-09-20 13:45:52,193 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-20 13:45:52,193 INFO L1541 ArrayList]: Function contract at [L9]: requires null, ensures (\result < 10) [2024-09-20 13:45:52,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 13:45:52,346 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/recursive-simple/id2_b5_o10.c[773,786] [2024-09-20 13:45:52,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:45:52,358 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global [2024-09-20 13:45:52,392 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/recursive-simple/id2_b5_o10.c[773,786] [2024-09-20 13:45:52,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:45:52,404 INFO L204 MainTranslator]: Completed translation [2024-09-20 13:45:52,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:52 WrapperNode [2024-09-20 13:45:52,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 13:45:52,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 13:45:52,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 13:45:52,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 13:45:52,414 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:45:52" (1/1) ... [2024-09-20 13:45:52,424 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:45:52" (1/1) ... [2024-09-20 13:45:52,439 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-09-20 13:45:52,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 13:45:52,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 13:45:52,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 13:45:52,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 13:45:52,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:52" (1/1) ... [2024-09-20 13:45:52,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:52" (1/1) ... [2024-09-20 13:45:52,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:52" (1/1) ... [2024-09-20 13:45:52,463 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure id is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-20 13:45:52,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:52" (1/1) ... [2024-09-20 13:45:52,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:52" (1/1) ... [2024-09-20 13:45:52,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:52" (1/1) ... [2024-09-20 13:45:52,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:52" (1/1) ... [2024-09-20 13:45:52,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:52" (1/1) ... [2024-09-20 13:45:52,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:52" (1/1) ... [2024-09-20 13:45:52,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 13:45:52,477 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 13:45:52,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 13:45:52,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 13:45:52,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:52" (1/1) ... [2024-09-20 13:45:52,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:45:52,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:45:52,522 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:45:52,524 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:45:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 13:45:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-20 13:45:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2024-09-20 13:45:52,573 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2024-09-20 13:45:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 13:45:52,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 13:45:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-09-20 13:45:52,573 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-09-20 13:45:52,653 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 13:45:52,656 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 13:45:52,861 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-20 13:45:52,861 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 13:45:52,890 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 13:45:52,893 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-20 13:45:52,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:45:52 BoogieIcfgContainer [2024-09-20 13:45:52,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 13:45:52,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 13:45:52,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 13:45:52,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 13:45:52,900 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:45:50" (1/4) ... [2024-09-20 13:45:52,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdff7f6 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.09 01:45:52, skipping insertion in model container [2024-09-20 13:45:52,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:45:52" (2/4) ... [2024-09-20 13:45:52,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdff7f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:45:52, skipping insertion in model container [2024-09-20 13:45:52,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:52" (3/4) ... [2024-09-20 13:45:52,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdff7f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:45:52, skipping insertion in model container [2024-09-20 13:45:52,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:45:52" (4/4) ... [2024-09-20 13:45:52,904 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b5_o10.c [2024-09-20 13:45:52,922 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 13:45:52,923 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-09-20 13:45:52,973 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 13:45:52,980 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;@74afdb10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 13:45:52,981 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-20 13:45:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-20 13:45:52,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-20 13:45:52,992 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:52,993 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-20 13:45:52,994 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:53,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:53,001 INFO L85 PathProgramCache]: Analyzing trace with hash 73343560, now seen corresponding path program 1 times [2024-09-20 13:45:53,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:53,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597143848] [2024-09-20 13:45:53,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:53,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:53,205 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:45:53,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:53,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597143848] [2024-09-20 13:45:53,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597143848] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:45:53,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:45:53,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 13:45:53,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58487219] [2024-09-20 13:45:53,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:53,215 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:45:53,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:53,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:45:53,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:45:53,252 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-20 13:45:53,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:53,294 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-09-20 13:45:53,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:45:53,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-20 13:45:53,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:53,305 INFO L225 Difference]: With dead ends: 25 [2024-09-20 13:45:53,305 INFO L226 Difference]: Without dead ends: 23 [2024-09-20 13:45:53,307 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:45:53,311 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 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:45:53,313 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:45:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-20 13:45:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-09-20 13:45:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-20 13:45:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-09-20 13:45:53,340 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 5 [2024-09-20 13:45:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:53,341 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-09-20 13:45:53,341 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-20 13:45:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-09-20 13:45:53,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-20 13:45:53,342 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:53,342 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:53,342 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 13:45:53,343 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:53,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:53,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1610947187, now seen corresponding path program 1 times [2024-09-20 13:45:53,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:53,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649709741] [2024-09-20 13:45:53,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:53,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:53,436 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 13:45:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:53,497 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:45:53,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:53,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649709741] [2024-09-20 13:45:53,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649709741] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:45:53,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:45:53,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 13:45:53,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081626002] [2024-09-20 13:45:53,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:53,501 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 13:45:53,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:53,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 13:45:53,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:45:53,506 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 13:45:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:53,535 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-09-20 13:45:53,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 13:45:53,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-09-20 13:45:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:53,537 INFO L225 Difference]: With dead ends: 25 [2024-09-20 13:45:53,537 INFO L226 Difference]: Without dead ends: 23 [2024-09-20 13:45:53,537 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:45:53,539 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:53,540 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:45:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-20 13:45:53,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-20 13:45:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-20 13:45:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-09-20 13:45:53,544 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 9 [2024-09-20 13:45:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:53,545 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-09-20 13:45:53,545 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 13:45:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-09-20 13:45:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-20 13:45:53,546 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:53,546 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:53,546 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 13:45:53,547 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:53,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:53,547 INFO L85 PathProgramCache]: Analyzing trace with hash -477854253, now seen corresponding path program 1 times [2024-09-20 13:45:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:53,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489698114] [2024-09-20 13:45:53,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:53,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:53,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-20 13:45:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:53,729 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:45:53,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:53,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489698114] [2024-09-20 13:45:53,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489698114] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:45:53,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:45:53,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 13:45:53,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423867442] [2024-09-20 13:45:53,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:53,731 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 13:45:53,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:53,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 13:45:53,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:45:53,733 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 13:45:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:53,755 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-09-20 13:45:53,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 13:45:53,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-20 13:45:53,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:53,758 INFO L225 Difference]: With dead ends: 27 [2024-09-20 13:45:53,758 INFO L226 Difference]: Without dead ends: 27 [2024-09-20 13:45:53,759 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:45:53,760 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:53,763 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:45:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-20 13:45:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-20 13:45:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-20 13:45:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-20 13:45:53,768 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 12 [2024-09-20 13:45:53,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:53,768 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-20 13:45:53,769 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 13:45:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-20 13:45:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-20 13:45:53,769 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:53,770 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:53,770 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 13:45:53,770 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:53,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:53,771 INFO L85 PathProgramCache]: Analyzing trace with hash -477854222, now seen corresponding path program 1 times [2024-09-20 13:45:53,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:53,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122716472] [2024-09-20 13:45:53,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:53,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:53,876 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-20 13:45:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:53,913 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:45:53,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:53,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122716472] [2024-09-20 13:45:53,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122716472] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:45:53,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:45:53,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 13:45:53,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087972494] [2024-09-20 13:45:53,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:53,915 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 13:45:53,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:53,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 13:45:53,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-20 13:45:53,918 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 13:45:53,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:53,962 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-09-20 13:45:53,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 13:45:53,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-20 13:45:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:53,963 INFO L225 Difference]: With dead ends: 29 [2024-09-20 13:45:53,963 INFO L226 Difference]: Without dead ends: 29 [2024-09-20 13:45:53,964 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-20 13:45:53,965 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 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:45:53,965 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:45:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-20 13:45:53,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-09-20 13:45:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-20 13:45:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-09-20 13:45:53,973 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 12 [2024-09-20 13:45:53,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:53,974 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-09-20 13:45:53,975 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 13:45:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-09-20 13:45:53,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 13:45:53,976 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:53,976 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:53,976 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 13:45:53,977 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:53,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:53,977 INFO L85 PathProgramCache]: Analyzing trace with hash -518888393, now seen corresponding path program 1 times [2024-09-20 13:45:53,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:53,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237664542] [2024-09-20 13:45:53,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:53,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:54,097 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 13:45:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:54,169 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:45:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:54,196 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:45:54,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:54,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237664542] [2024-09-20 13:45:54,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237664542] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:45:54,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:45:54,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-20 13:45:54,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081074699] [2024-09-20 13:45:54,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:54,199 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 13:45:54,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:54,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 13:45:54,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-20 13:45:54,200 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 13:45:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:54,251 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-09-20 13:45:54,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 13:45:54,252 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-20 13:45:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:54,253 INFO L225 Difference]: With dead ends: 31 [2024-09-20 13:45:54,253 INFO L226 Difference]: Without dead ends: 29 [2024-09-20 13:45:54,254 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-20 13:45:54,255 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:54,255 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:45:54,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-20 13:45:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-20 13:45:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-20 13:45:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-20 13:45:54,264 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2024-09-20 13:45:54,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:54,264 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-20 13:45:54,266 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 13:45:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-20 13:45:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-20 13:45:54,267 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:54,267 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:54,268 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 13:45:54,268 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:54,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:54,268 INFO L85 PathProgramCache]: Analyzing trace with hash 77705380, now seen corresponding path program 1 times [2024-09-20 13:45:54,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:54,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684237356] [2024-09-20 13:45:54,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:54,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:54,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 13:45:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:54,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:45:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-20 13:45:54,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:54,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684237356] [2024-09-20 13:45:54,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684237356] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:45:54,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:45:54,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 13:45:54,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715275978] [2024-09-20 13:45:54,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:54,454 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 13:45:54,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:54,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 13:45:54,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:45:54,455 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 13:45:54,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:54,493 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-09-20 13:45:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 13:45:54,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-09-20 13:45:54,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:54,495 INFO L225 Difference]: With dead ends: 31 [2024-09-20 13:45:54,496 INFO L226 Difference]: Without dead ends: 31 [2024-09-20 13:45:54,497 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:45:54,497 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:54,498 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:45:54,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-20 13:45:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-20 13:45:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-20 13:45:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-20 13:45:54,503 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 25 [2024-09-20 13:45:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:54,504 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-20 13:45:54,504 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 13:45:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-20 13:45:54,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-20 13:45:54,505 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:54,505 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:54,505 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 13:45:54,505 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:54,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:54,506 INFO L85 PathProgramCache]: Analyzing trace with hash 106334531, now seen corresponding path program 1 times [2024-09-20 13:45:54,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:54,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756792109] [2024-09-20 13:45:54,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:54,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:54,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 13:45:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:54,689 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:45:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-20 13:45:54,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:54,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756792109] [2024-09-20 13:45:54,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756792109] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:45:54,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:45:54,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-20 13:45:54,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045246217] [2024-09-20 13:45:54,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:54,720 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 13:45:54,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:54,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 13:45:54,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-20 13:45:54,721 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 13:45:54,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:54,769 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-09-20 13:45:54,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 13:45:54,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-09-20 13:45:54,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:54,771 INFO L225 Difference]: With dead ends: 35 [2024-09-20 13:45:54,772 INFO L226 Difference]: Without dead ends: 35 [2024-09-20 13:45:54,772 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-20 13:45:54,773 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:54,773 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:45:54,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-20 13:45:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-20 13:45:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-20 13:45:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-09-20 13:45:54,778 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 25 [2024-09-20 13:45:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:54,778 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-09-20 13:45:54,778 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 13:45:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-09-20 13:45:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-20 13:45:54,779 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:54,779 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:54,779 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-20 13:45:54,779 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:54,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:54,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1119410942, now seen corresponding path program 1 times [2024-09-20 13:45:54,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:54,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060441960] [2024-09-20 13:45:54,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:54,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:54,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-20 13:45:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:54,891 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:45:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-20 13:45:54,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:54,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060441960] [2024-09-20 13:45:54,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060441960] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:45:54,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63792084] [2024-09-20 13:45:54,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:54,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:45:54,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:45:54,922 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:45:54,923 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:45:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:54,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-20 13:45:54,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:45:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-20 13:45:55,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:45:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-20 13:45:55,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63792084] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-20 13:45:55,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-20 13:45:55,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8, 8] total 10 [2024-09-20 13:45:55,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683288008] [2024-09-20 13:45:55,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:55,097 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:45:55,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:55,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:45:55,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-09-20 13:45:55,099 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 13:45:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:55,111 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-09-20 13:45:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:45:55,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-09-20 13:45:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:55,112 INFO L225 Difference]: With dead ends: 34 [2024-09-20 13:45:55,112 INFO L226 Difference]: Without dead ends: 34 [2024-09-20 13:45:55,112 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-09-20 13:45:55,113 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:55,114 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:45:55,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-20 13:45:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-20 13:45:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-20 13:45:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-09-20 13:45:55,118 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2024-09-20 13:45:55,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:55,118 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-09-20 13:45:55,118 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 13:45:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-09-20 13:45:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-20 13:45:55,119 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:55,119 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:55,137 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-20 13:45:55,323 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:45:55,324 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:55,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:55,325 INFO L85 PathProgramCache]: Analyzing trace with hash 884822851, now seen corresponding path program 1 times [2024-09-20 13:45:55,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:55,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080552193] [2024-09-20 13:45:55,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:55,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:55,411 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 13:45:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:55,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:45:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:55,652 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:45:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-20 13:45:55,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:55,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080552193] [2024-09-20 13:45:55,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080552193] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:45:55,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106079528] [2024-09-20 13:45:55,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:55,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:45:55,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:45:55,687 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:45:55,689 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:45:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:55,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-20 13:45:55,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:45:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-20 13:45:55,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:45:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-20 13:45:55,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106079528] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-20 13:45:55,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-20 13:45:55,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 11] total 15 [2024-09-20 13:45:55,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624952076] [2024-09-20 13:45:55,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:55,900 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 13:45:55,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:55,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 13:45:55,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-09-20 13:45:55,901 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 13:45:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:55,917 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-09-20 13:45:55,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 13:45:55,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-09-20 13:45:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:55,918 INFO L225 Difference]: With dead ends: 32 [2024-09-20 13:45:55,919 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 13:45:55,920 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-09-20 13:45:55,920 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:55,920 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:45:55,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 13:45:55,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 13:45:55,921 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:45:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 13:45:55,921 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2024-09-20 13:45:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:55,921 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 13:45:55,922 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 13:45:55,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 13:45:55,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 13:45:55,926 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-09-20 13:45:55,926 INFO L785 garLoopResultBuilder]: Registering result SAFE for location idErr0ENSURES_VIOLATIONPOST_CONDITION (0 of 2 remaining) [2024-09-20 13:45:55,943 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 13:45:56,128 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:45:56,131 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:56,133 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 13:45:56,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:45:56 BoogieIcfgContainer [2024-09-20 13:45:56,135 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 13:45:56,135 INFO L158 Benchmark]: Toolchain (without parser) took 3960.73ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 127.3MB in the beginning and 144.8MB in the end (delta: -17.5MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-09-20 13:45:56,136 INFO L158 Benchmark]: Witness Parser took 0.20ms. Allocated memory is still 109.1MB. Free memory was 78.6MB in the beginning and 78.4MB in the end (delta: 159.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:45:56,136 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 109.1MB. Free memory was 76.6MB in the beginning and 76.5MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:45:56,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.80ms. Allocated memory is still 165.7MB. Free memory was 127.3MB in the beginning and 114.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 13:45:56,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.80ms. Allocated memory is still 165.7MB. Free memory was 114.7MB in the beginning and 112.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 13:45:56,137 INFO L158 Benchmark]: Boogie Preprocessor took 35.62ms. Allocated memory is still 165.7MB. Free memory was 112.6MB in the beginning and 111.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 13:45:56,137 INFO L158 Benchmark]: RCFGBuilder took 416.27ms. Allocated memory is still 165.7MB. Free memory was 111.5MB in the beginning and 128.6MB in the end (delta: -17.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-20 13:45:56,137 INFO L158 Benchmark]: TraceAbstraction took 3239.76ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 127.6MB in the beginning and 144.8MB in the end (delta: -17.3MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-09-20 13:45:56,139 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.20ms. Allocated memory is still 109.1MB. Free memory was 78.6MB in the beginning and 78.4MB in the end (delta: 159.9kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.75ms. Allocated memory is still 109.1MB. Free memory was 76.6MB in the beginning and 76.5MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.80ms. Allocated memory is still 165.7MB. Free memory was 127.3MB in the beginning and 114.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.80ms. Allocated memory is still 165.7MB. Free memory was 114.7MB in the beginning and 112.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.62ms. Allocated memory is still 165.7MB. Free memory was 112.6MB in the beginning and 111.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 416.27ms. Allocated memory is still 165.7MB. Free memory was 111.5MB in the beginning and 128.6MB in the end (delta: -17.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3239.76ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 127.6MB in the beginning and 144.8MB in the end (delta: -17.3MB). Peak memory consumption was 20.5MB. 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: 27]: 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: 9]: 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, 23 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 794 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 598 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 196 mSDtfsCounter, 191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=7, InterpolantAutomatonStates: 48, 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, 9 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 431 SizeOfPredicates, 0 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 37/43 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-20 13:45:56,159 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...