This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 13:30:32,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 13:30:32,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 13:30:32,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 13:30:32,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 13:30:32,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 13:30:32,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 13:30:32,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 13:30:32,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 13:30:32,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 13:30:32,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 13:30:32,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 13:30:32,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 13:30:32,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 13:30:32,142 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 13:30:32,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 13:30:32,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 13:30:32,143 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 13:30:32,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 13:30:32,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 13:30:32,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 13:30:32,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 13:30:32,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 13:30:32,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 13:30:32,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 13:30:32,147 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 13:30:32,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 13:30:32,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 13:30:32,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 13:30:32,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 13:30:32,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 13:30:32,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 13:30:32,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:30:32,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 13:30:32,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 13:30:32,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 13:30:32,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 13:30:32,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 13:30:32,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 13:30:32,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 13:30:32,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 13:30:32,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 13:30:32,155 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-20 13:30:32,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 13:30:32,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 13:30:32,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 13:30:32,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 13:30:32,458 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 13:30:32,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2024-09-20 13:30:33,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 13:30:34,074 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 13:30:34,074 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2024-09-20 13:30:34,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6e696d91b/c25bf5f6e7f44c6d8cd99478865fc4de/FLAG5ace400d2 [2024-09-20 13:30:34,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6e696d91b/c25bf5f6e7f44c6d8cd99478865fc4de [2024-09-20 13:30:34,097 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-20 13:30:34,098 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-20 13:30:34,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/apache-escape-absolute.yml/witness-2.1.yml [2024-09-20 13:30:34,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 13:30:34,153 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-20 13:30:34,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 13:30:34,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 13:30:34,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 13:30:34,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:30:34" (1/2) ... [2024-09-20 13:30:34,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@81b9e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:34, skipping insertion in model container [2024-09-20 13:30:34,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:30:34" (1/2) ... [2024-09-20 13:30:34,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@74441408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:30:34, skipping insertion in model container [2024-09-20 13:30:34,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:30:34" (2/2) ... [2024-09-20 13:30:34,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@81b9e0d and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:34, skipping insertion in model container [2024-09-20 13:30:34,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:30:34" (2/2) ... [2024-09-20 13:30:34,178 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-20 13:30:34,181 INFO L1541 ArrayList]: Loop invariant at [L47-L52] ((((long long) cp + 1) <= urilen) && (1 <= cp)) [2024-09-20 13:30:34,182 INFO L1541 ArrayList]: Loop invariant at [L65-L77] ((((((long long) cp + 1) <= urilen) && (c == 0)) && (1 <= cp)) || (((1 <= c) && (((long long) cp + 1) <= urilen)) && (1 <= cp))) [2024-09-20 13:30:34,182 INFO L1541 ArrayList]: Function contract at [L17]: requires (\old(cond) != 0), ensures (\old(cond) != 0) [2024-09-20 13:30:34,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 13:30:34,374 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2024-09-20 13:30:34,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:30:34,419 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global [2024-09-20 13:30:34,465 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] Start Parsing Local Start Parsing Local [2024-09-20 13:30:34,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:30:34,496 INFO L204 MainTranslator]: Completed translation [2024-09-20 13:30:34,497 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:34 WrapperNode [2024-09-20 13:30:34,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 13:30:34,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 13:30:34,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 13:30:34,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 13:30:34,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:34" (1/1) ... [2024-09-20 13:30:34,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:34" (1/1) ... [2024-09-20 13:30:34,540 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112 [2024-09-20 13:30:34,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 13:30:34,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 13:30:34,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 13:30:34,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 13:30:34,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:34" (1/1) ... [2024-09-20 13:30:34,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:34" (1/1) ... [2024-09-20 13:30:34,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:34" (1/1) ... [2024-09-20 13:30:34,591 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure __VERIFIER_assert is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-20 13:30:34,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:34" (1/1) ... [2024-09-20 13:30:34,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:34" (1/1) ... [2024-09-20 13:30:34,594 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:34" (1/1) ... [2024-09-20 13:30:34,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:34" (1/1) ... [2024-09-20 13:30:34,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:34" (1/1) ... [2024-09-20 13:30:34,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:34" (1/1) ... [2024-09-20 13:30:34,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 13:30:34,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 13:30:34,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 13:30:34,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 13:30:34,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:34" (1/1) ... [2024-09-20 13:30:34,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:30:34,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:30:34,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-20 13:30:34,653 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-20 13:30:34,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 13:30:34,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-20 13:30:34,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 13:30:34,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 13:30:34,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 13:30:34,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 13:30:34,775 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 13:30:34,777 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 13:30:35,032 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-20 13:30:35,061 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-09-20 13:30:35,062 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 13:30:35,087 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 13:30:35,088 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-20 13:30:35,088 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:30:35 BoogieIcfgContainer [2024-09-20 13:30:35,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 13:30:35,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 13:30:35,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 13:30:35,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 13:30:35,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:30:34" (1/4) ... [2024-09-20 13:30:35,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495ee6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:30:35, skipping insertion in model container [2024-09-20 13:30:35,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:30:34" (2/4) ... [2024-09-20 13:30:35,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495ee6cd and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.09 01:30:35, skipping insertion in model container [2024-09-20 13:30:35,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:30:34" (3/4) ... [2024-09-20 13:30:35,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495ee6cd and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.09 01:30:35, skipping insertion in model container [2024-09-20 13:30:35,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:30:35" (4/4) ... [2024-09-20 13:30:35,104 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2024-09-20 13:30:35,122 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 13:30:35,123 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-09-20 13:30:35,173 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 13:30:35,184 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;@2b2ef247, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 13:30:35,184 INFO L337 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-09-20 13:30:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 53 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-20 13:30:35,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-20 13:30:35,198 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:35,198 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:35,199 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-20 13:30:35,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:35,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1418037106, now seen corresponding path program 1 times [2024-09-20 13:30:35,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:35,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188434028] [2024-09-20 13:30:35,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:35,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:30:35,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:35,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188434028] [2024-09-20 13:30:35,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188434028] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:35,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:35,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 13:30:35,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181421526] [2024-09-20 13:30:35,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:35,458 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:30:35,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:35,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:30:35,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:30:35,487 INFO L87 Difference]: Start difference. First operand has 70 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 53 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:35,612 INFO L93 Difference]: Finished difference Result 67 states and 99 transitions. [2024-09-20 13:30:35,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:30:35,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-09-20 13:30:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:35,623 INFO L225 Difference]: With dead ends: 67 [2024-09-20 13:30:35,623 INFO L226 Difference]: Without dead ends: 62 [2024-09-20 13:30:35,625 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:30:35,628 INFO L434 NwaCegarLoop]: 73 mSDtfsCounter, 16 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:35,630 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 109 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:30:35,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-20 13:30:35,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2024-09-20 13:30:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-20 13:30:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2024-09-20 13:30:35,673 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 9 [2024-09-20 13:30:35,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:35,673 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2024-09-20 13:30:35,673 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:35,674 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2024-09-20 13:30:35,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-20 13:30:35,674 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:35,674 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:35,674 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 13:30:35,675 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-20 13:30:35,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:35,676 INFO L85 PathProgramCache]: Analyzing trace with hash -551249728, now seen corresponding path program 1 times [2024-09-20 13:30:35,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:35,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141186301] [2024-09-20 13:30:35,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:35,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:35,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:30:35,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:35,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141186301] [2024-09-20 13:30:35,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141186301] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:35,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:35,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:30:35,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215624729] [2024-09-20 13:30:35,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:35,792 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:30:35,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:35,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:30:35,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:30:35,793 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (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:30:35,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:35,816 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2024-09-20 13:30:35,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:30:35,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (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 12 [2024-09-20 13:30:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:35,819 INFO L225 Difference]: With dead ends: 59 [2024-09-20 13:30:35,819 INFO L226 Difference]: Without dead ends: 59 [2024-09-20 13:30:35,820 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:30:35,821 INFO L434 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:35,822 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:30:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-20 13:30:35,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-20 13:30:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.162162162162162) internal successors, (43), 42 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-20 13:30:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2024-09-20 13:30:35,837 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 12 [2024-09-20 13:30:35,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:35,837 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2024-09-20 13:30:35,837 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (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:30:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2024-09-20 13:30:35,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-20 13:30:35,839 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:35,840 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:35,840 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 13:30:35,840 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-20 13:30:35,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:35,843 INFO L85 PathProgramCache]: Analyzing trace with hash -551249567, now seen corresponding path program 1 times [2024-09-20 13:30:35,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:35,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226886017] [2024-09-20 13:30:35,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:35,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:30:35,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:35,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226886017] [2024-09-20 13:30:35,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226886017] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:35,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:35,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 13:30:35,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472653193] [2024-09-20 13:30:35,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:35,881 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:30:35,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:35,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:30:35,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:30:35,882 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (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:30:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:35,986 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2024-09-20 13:30:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:30:35,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (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 12 [2024-09-20 13:30:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:35,989 INFO L225 Difference]: With dead ends: 58 [2024-09-20 13:30:35,989 INFO L226 Difference]: Without dead ends: 58 [2024-09-20 13:30:35,989 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:30:35,990 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:35,991 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:30:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-20 13:30:35,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-09-20 13:30:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.135135135135135) internal successors, (42), 41 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-20 13:30:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2024-09-20 13:30:36,003 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 12 [2024-09-20 13:30:36,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:36,004 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-09-20 13:30:36,004 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (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:30:36,004 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2024-09-20 13:30:36,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-20 13:30:36,005 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:36,005 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:36,005 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 13:30:36,005 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-20 13:30:36,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:36,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1469852467, now seen corresponding path program 1 times [2024-09-20 13:30:36,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:36,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369236137] [2024-09-20 13:30:36,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:36,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-20 13:30:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:30:36,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:36,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369236137] [2024-09-20 13:30:36,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369236137] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:36,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:36,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:30:36,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492466023] [2024-09-20 13:30:36,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:36,107 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 13:30:36,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:36,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 13:30:36,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:30:36,111 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:30:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:36,176 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2024-09-20 13:30:36,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 13:30:36,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2024-09-20 13:30:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:36,177 INFO L225 Difference]: With dead ends: 50 [2024-09-20 13:30:36,177 INFO L226 Difference]: Without dead ends: 50 [2024-09-20 13:30:36,177 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:30:36,178 INFO L434 NwaCegarLoop]: 54 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:36,179 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 132 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:30:36,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-20 13:30:36,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-09-20 13:30:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 33 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-20 13:30:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2024-09-20 13:30:36,184 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 14 [2024-09-20 13:30:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:36,186 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2024-09-20 13:30:36,186 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:30:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2024-09-20 13:30:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-20 13:30:36,187 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:36,187 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:36,187 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 13:30:36,187 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-20 13:30:36,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:36,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1163595571, now seen corresponding path program 1 times [2024-09-20 13:30:36,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:36,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040307729] [2024-09-20 13:30:36,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:36,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,297 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-20 13:30:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,312 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-20 13:30:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,319 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 13:30:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,327 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-20 13:30:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 13:30:36,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:36,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040307729] [2024-09-20 13:30:36,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040307729] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:36,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:36,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:30:36,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407779664] [2024-09-20 13:30:36,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:36,340 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 13:30:36,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:36,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 13:30:36,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:30:36,342 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-20 13:30:36,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:36,395 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2024-09-20 13:30:36,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 13:30:36,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-09-20 13:30:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:36,397 INFO L225 Difference]: With dead ends: 51 [2024-09-20 13:30:36,397 INFO L226 Difference]: Without dead ends: 51 [2024-09-20 13:30:36,398 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:30:36,401 INFO L434 NwaCegarLoop]: 58 mSDtfsCounter, 12 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:36,401 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 141 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:30:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-20 13:30:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-20 13:30:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 33 states have internal predecessors, (35), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-20 13:30:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2024-09-20 13:30:36,408 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 31 [2024-09-20 13:30:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:36,408 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2024-09-20 13:30:36,408 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-20 13:30:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2024-09-20 13:30:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-20 13:30:36,410 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:36,410 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:36,410 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 13:30:36,412 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-20 13:30:36,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash -371231729, now seen corresponding path program 1 times [2024-09-20 13:30:36,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:36,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782844426] [2024-09-20 13:30:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:36,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,480 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-20 13:30:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,488 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-20 13:30:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,493 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 13:30:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,500 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-20 13:30:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,505 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-20 13:30:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,514 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-20 13:30:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-20 13:30:36,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:36,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782844426] [2024-09-20 13:30:36,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782844426] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:36,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:36,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:30:36,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445552854] [2024-09-20 13:30:36,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:36,527 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:30:36,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:36,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:30:36,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:30:36,528 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-20 13:30:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:36,565 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2024-09-20 13:30:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:30:36,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-09-20 13:30:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:36,567 INFO L225 Difference]: With dead ends: 54 [2024-09-20 13:30:36,567 INFO L226 Difference]: Without dead ends: 51 [2024-09-20 13:30:36,567 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:30:36,568 INFO L434 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:36,568 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:30:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-20 13:30:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-20 13:30:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 33 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-20 13:30:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2024-09-20 13:30:36,573 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 44 [2024-09-20 13:30:36,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:36,574 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2024-09-20 13:30:36,574 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-20 13:30:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2024-09-20 13:30:36,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-20 13:30:36,575 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:36,575 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:36,575 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 13:30:36,575 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-20 13:30:36,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:36,576 INFO L85 PathProgramCache]: Analyzing trace with hash 663179677, now seen corresponding path program 1 times [2024-09-20 13:30:36,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:36,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126733280] [2024-09-20 13:30:36,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:36,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-20 13:30:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,674 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-20 13:30:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,678 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 13:30:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,684 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-20 13:30:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,687 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 13:30:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,693 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 13:30:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-20 13:30:36,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:36,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126733280] [2024-09-20 13:30:36,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126733280] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:36,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:36,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:30:36,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638154127] [2024-09-20 13:30:36,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:36,702 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 13:30:36,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:36,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 13:30:36,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:30:36,703 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-20 13:30:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:36,784 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2024-09-20 13:30:36,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 13:30:36,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2024-09-20 13:30:36,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:36,786 INFO L225 Difference]: With dead ends: 51 [2024-09-20 13:30:36,788 INFO L226 Difference]: Without dead ends: 51 [2024-09-20 13:30:36,789 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:30:36,789 INFO L434 NwaCegarLoop]: 55 mSDtfsCounter, 22 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:36,790 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 81 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:30:36,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-20 13:30:36,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-09-20 13:30:36,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-20 13:30:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 68 transitions. [2024-09-20 13:30:36,799 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 68 transitions. Word has length 45 [2024-09-20 13:30:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:36,800 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 68 transitions. [2024-09-20 13:30:36,800 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-20 13:30:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2024-09-20 13:30:36,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-20 13:30:36,803 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:36,803 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:36,803 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-20 13:30:36,803 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-20 13:30:36,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:36,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1923684362, now seen corresponding path program 1 times [2024-09-20 13:30:36,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:36,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102679064] [2024-09-20 13:30:36,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:36,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-20 13:30:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-20 13:30:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,920 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 13:30:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,927 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-20 13:30:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,930 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 13:30:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,938 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 13:30:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-20 13:30:36,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:36,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102679064] [2024-09-20 13:30:36,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102679064] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:36,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:36,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-20 13:30:36,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333632899] [2024-09-20 13:30:36,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:36,948 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 13:30:36,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:36,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 13:30:36,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:30:36,949 INFO L87 Difference]: Start difference. First operand 49 states and 68 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-20 13:30:37,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:37,060 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2024-09-20 13:30:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 13:30:37,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2024-09-20 13:30:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:37,061 INFO L225 Difference]: With dead ends: 61 [2024-09-20 13:30:37,062 INFO L226 Difference]: Without dead ends: 61 [2024-09-20 13:30:37,062 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-09-20 13:30:37,062 INFO L434 NwaCegarLoop]: 70 mSDtfsCounter, 25 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:37,063 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 180 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:30:37,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-20 13:30:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2024-09-20 13:30:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 30 states have internal predecessors, (30), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-20 13:30:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2024-09-20 13:30:37,073 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 45 [2024-09-20 13:30:37,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:37,073 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2024-09-20 13:30:37,074 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-20 13:30:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2024-09-20 13:30:37,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-20 13:30:37,075 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:37,076 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:37,076 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-20 13:30:37,076 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-20 13:30:37,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:37,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1124997950, now seen corresponding path program 1 times [2024-09-20 13:30:37,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:37,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765015781] [2024-09-20 13:30:37,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:37,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-20 13:30:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,220 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-20 13:30:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 13:30:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,225 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-20 13:30:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,228 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 13:30:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,233 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 13:30:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-20 13:30:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,243 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 13:30:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-20 13:30:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,252 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-20 13:30:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-09-20 13:30:37,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:37,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765015781] [2024-09-20 13:30:37,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765015781] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:37,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:37,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 13:30:37,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195995155] [2024-09-20 13:30:37,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:37,259 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 13:30:37,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:37,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 13:30:37,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-20 13:30:37,260 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-20 13:30:37,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:37,398 INFO L93 Difference]: Finished difference Result 68 states and 97 transitions. [2024-09-20 13:30:37,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 13:30:37,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 67 [2024-09-20 13:30:37,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:37,400 INFO L225 Difference]: With dead ends: 68 [2024-09-20 13:30:37,400 INFO L226 Difference]: Without dead ends: 68 [2024-09-20 13:30:37,400 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-09-20 13:30:37,400 INFO L434 NwaCegarLoop]: 69 mSDtfsCounter, 46 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:37,401 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 113 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:30:37,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-20 13:30:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2024-09-20 13:30:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-20 13:30:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2024-09-20 13:30:37,412 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 67 [2024-09-20 13:30:37,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:37,412 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2024-09-20 13:30:37,412 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-20 13:30:37,413 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2024-09-20 13:30:37,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-09-20 13:30:37,414 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:37,414 INFO L216 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:37,414 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-20 13:30:37,414 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-20 13:30:37,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:37,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1959119514, now seen corresponding path program 1 times [2024-09-20 13:30:37,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:37,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005418090] [2024-09-20 13:30:37,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:37,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,534 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-20 13:30:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,537 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-20 13:30:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 13:30:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,541 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-20 13:30:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,543 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 13:30:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,544 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 13:30:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,546 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-20 13:30:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,548 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 13:30:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,550 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-20 13:30:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,552 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-20 13:30:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,553 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-20 13:30:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,556 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-20 13:30:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-09-20 13:30:37,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:37,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005418090] [2024-09-20 13:30:37,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005418090] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:37,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:37,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:30:37,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915276291] [2024-09-20 13:30:37,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:37,561 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 13:30:37,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:37,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 13:30:37,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:30:37,561 INFO L87 Difference]: Start difference. First operand 54 states and 76 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-09-20 13:30:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:37,597 INFO L93 Difference]: Finished difference Result 58 states and 81 transitions. [2024-09-20 13:30:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 13:30:37,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2024-09-20 13:30:37,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:37,598 INFO L225 Difference]: With dead ends: 58 [2024-09-20 13:30:37,598 INFO L226 Difference]: Without dead ends: 58 [2024-09-20 13:30:37,599 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:30:37,600 INFO L434 NwaCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:37,600 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 153 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:30:37,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-20 13:30:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2024-09-20 13:30:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-20 13:30:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-09-20 13:30:37,608 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 81 [2024-09-20 13:30:37,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:37,609 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-09-20 13:30:37,609 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-09-20 13:30:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-09-20 13:30:37,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-09-20 13:30:37,610 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:37,611 INFO L216 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:37,611 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-20 13:30:37,611 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-20 13:30:37,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:37,612 INFO L85 PathProgramCache]: Analyzing trace with hash 3523265, now seen corresponding path program 1 times [2024-09-20 13:30:37,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:37,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386641020] [2024-09-20 13:30:37,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:37,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-20 13:30:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,694 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-20 13:30:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,696 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 13:30:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,698 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-20 13:30:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 13:30:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,705 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 13:30:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,707 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-20 13:30:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 13:30:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,711 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-20 13:30:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,714 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-20 13:30:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,718 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-20 13:30:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,723 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-20 13:30:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,726 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-20 13:30:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-09-20 13:30:37,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:37,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386641020] [2024-09-20 13:30:37,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386641020] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:30:37,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:30:37,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:30:37,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883138809] [2024-09-20 13:30:37,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:37,745 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 13:30:37,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:37,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 13:30:37,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:30:37,747 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-20 13:30:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:37,785 INFO L93 Difference]: Finished difference Result 52 states and 74 transitions. [2024-09-20 13:30:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 13:30:37,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 86 [2024-09-20 13:30:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:37,786 INFO L225 Difference]: With dead ends: 52 [2024-09-20 13:30:37,786 INFO L226 Difference]: Without dead ends: 52 [2024-09-20 13:30:37,786 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:30:37,787 INFO L434 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:37,787 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 167 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:30:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-20 13:30:37,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-09-20 13:30:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 33 states have internal predecessors, (34), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-20 13:30:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-09-20 13:30:37,791 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 86 [2024-09-20 13:30:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:37,792 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-09-20 13:30:37,792 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-20 13:30:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-09-20 13:30:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-09-20 13:30:37,793 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:30:37,793 INFO L216 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:37,794 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-20 13:30:37,794 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 19 more)] === [2024-09-20 13:30:37,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:30:37,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1371400769, now seen corresponding path program 1 times [2024-09-20 13:30:37,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:30:37,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090472603] [2024-09-20 13:30:37,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:37,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:30:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,045 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-20 13:30:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,047 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-20 13:30:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,053 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 13:30:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,055 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-20 13:30:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,057 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 13:30:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,064 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 13:30:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,070 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-20 13:30:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 13:30:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-20 13:30:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-20 13:30:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-20 13:30:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,097 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-20 13:30:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,104 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-20 13:30:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-20 13:30:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,121 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-09-20 13:30:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-09-20 13:30:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-20 13:30:38,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:30:38,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090472603] [2024-09-20 13:30:38,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090472603] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:30:38,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382661667] [2024-09-20 13:30:38,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:30:38,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:30:38,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:30:38,136 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:30:38,137 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-20 13:30:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:30:38,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-20 13:30:38,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:30:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-20 13:30:38,431 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:30:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-20 13:30:38,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382661667] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-20 13:30:38,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-20 13:30:38,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 8] total 12 [2024-09-20 13:30:38,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340783358] [2024-09-20 13:30:38,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:30:38,697 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 13:30:38,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:30:38,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 13:30:38,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-09-20 13:30:38,698 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-09-20 13:30:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:30:38,784 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2024-09-20 13:30:38,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 13:30:38,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 102 [2024-09-20 13:30:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:30:38,785 INFO L225 Difference]: With dead ends: 57 [2024-09-20 13:30:38,785 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 13:30:38,785 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-09-20 13:30:38,786 INFO L434 NwaCegarLoop]: 72 mSDtfsCounter, 7 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:30:38,786 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 214 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:30:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 13:30:38,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 13:30:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:30:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 13:30:38,787 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2024-09-20 13:30:38,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:30:38,787 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 13:30:38,788 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-09-20 13:30:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 13:30:38,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 13:30:38,790 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION (21 of 22 remaining) [2024-09-20 13:30:38,791 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (20 of 22 remaining) [2024-09-20 13:30:38,791 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (19 of 22 remaining) [2024-09-20 13:30:38,791 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (18 of 22 remaining) [2024-09-20 13:30:38,791 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 22 remaining) [2024-09-20 13:30:38,792 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (16 of 22 remaining) [2024-09-20 13:30:38,792 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION (15 of 22 remaining) [2024-09-20 13:30:38,792 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION (14 of 22 remaining) [2024-09-20 13:30:38,792 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION (13 of 22 remaining) [2024-09-20 13:30:38,792 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION (12 of 22 remaining) [2024-09-20 13:30:38,792 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONPRE_CONDITION (11 of 22 remaining) [2024-09-20 13:30:38,793 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONPRE_CONDITION (10 of 22 remaining) [2024-09-20 13:30:38,793 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONPRE_CONDITION (9 of 22 remaining) [2024-09-20 13:30:38,793 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 22 remaining) [2024-09-20 13:30:38,793 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONPRE_CONDITION (7 of 22 remaining) [2024-09-20 13:30:38,794 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONPRE_CONDITION (6 of 22 remaining) [2024-09-20 13:30:38,794 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONPRE_CONDITION (5 of 22 remaining) [2024-09-20 13:30:38,794 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONPRE_CONDITION (4 of 22 remaining) [2024-09-20 13:30:38,794 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONPRE_CONDITION (3 of 22 remaining) [2024-09-20 13:30:38,794 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONPRE_CONDITION (2 of 22 remaining) [2024-09-20 13:30:38,794 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 22 remaining) [2024-09-20 13:30:38,795 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 22 remaining) [2024-09-20 13:30:38,811 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 13:30:38,995 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-20 13:30:38,998 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:30:39,000 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 13:30:39,003 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-20 13:30:39,003 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-20 13:30:39,004 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:30:39 BoogieIcfgContainer [2024-09-20 13:30:39,004 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 13:30:39,005 INFO L158 Benchmark]: Toolchain (without parser) took 4851.22ms. Allocated memory was 218.1MB in the beginning and 262.1MB in the end (delta: 44.0MB). Free memory was 160.2MB in the beginning and 207.9MB in the end (delta: -47.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:30:39,005 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:30:39,005 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 218.1MB. Free memory is still 162.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:30:39,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.88ms. Allocated memory is still 218.1MB. Free memory was 160.2MB in the beginning and 145.9MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-20 13:30:39,006 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.13ms. Allocated memory is still 218.1MB. Free memory was 145.9MB in the beginning and 144.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 13:30:39,006 INFO L158 Benchmark]: Boogie Preprocessor took 72.56ms. Allocated memory is still 218.1MB. Free memory was 144.2MB in the beginning and 142.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 13:30:39,006 INFO L158 Benchmark]: RCFGBuilder took 478.25ms. Allocated memory is still 218.1MB. Free memory was 142.1MB in the beginning and 123.9MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-09-20 13:30:39,006 INFO L158 Benchmark]: TraceAbstraction took 3909.30ms. Allocated memory was 218.1MB in the beginning and 262.1MB in the end (delta: 44.0MB). Free memory was 123.2MB in the beginning and 207.9MB in the end (delta: -84.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:30:39,008 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 218.1MB. Free memory is still 162.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.88ms. Allocated memory is still 218.1MB. Free memory was 160.2MB in the beginning and 145.9MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.13ms. Allocated memory is still 218.1MB. Free memory was 145.9MB in the beginning and 144.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.56ms. Allocated memory is still 218.1MB. Free memory was 144.2MB in the beginning and 142.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 478.25ms. Allocated memory is still 218.1MB. Free memory was 142.1MB in the beginning and 123.9MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3909.30ms. Allocated memory was 218.1MB in the beginning and 262.1MB in the end (delta: 44.0MB). Free memory was 123.2MB in the beginning and 207.9MB in the end (delta: -84.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 47]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 65]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 17]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 19]: 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: 17]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 233 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 1657 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 880 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 482 IncrementalHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 777 mSDtfsCounter, 482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 359 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, InterpolantAutomatonStates: 53, 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, 12 MinimizatonAttempts, 36 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 650 NumberOfCodeBlocks, 650 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 738 ConstructedInterpolants, 0 QuantifiedInterpolants, 1487 SizeOfPredicates, 1 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2402/2404 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 22 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-20 13:30:39,039 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...