./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 19:22:01,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:22:01,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:22:01,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:22:01,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:22:01,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:22:01,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:22:01,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:22:01,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:22:01,237 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:22:01,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:22:01,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:22:01,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:22:01,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:22:01,240 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:22:01,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:22:01,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:22:01,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:22:01,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:22:01,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:22:01,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:22:01,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:22:01,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:22:01,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:22:01,243 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:22:01,243 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:22:01,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:22:01,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:22:01,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:22:01,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:22:01,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:22:01,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:22:01,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:22:01,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:22:01,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:22:01,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:22:01,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:22:01,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:22:01,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:22:01,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:22:01,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:22:01,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:22:01,248 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.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 19:22:01,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:22:01,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:22:01,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:22:01,443 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:22:01,443 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:22:01,444 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-11 19:22:02,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:22:02,805 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:22:02,805 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2024-09-11 19:22:02,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/74f116bc9/887fb07cad6842efa9037e6d09590ab1/FLAG2e1603b1f [2024-09-11 19:22:03,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/74f116bc9/887fb07cad6842efa9037e6d09590ab1 [2024-09-11 19:22:03,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:22:03,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:22:03,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:22:03,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:22:03,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:22:03,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:22:03" (1/1) ... [2024-09-11 19:22:03,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75615826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:03, skipping insertion in model container [2024-09-11 19:22:03,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:22:03" (1/1) ... [2024-09-11 19:22:03,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:22:03,396 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2024-09-11 19:22:03,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:22:03,435 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:22:03,445 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2024-09-11 19:22:03,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:22:03,474 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:22:03,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:03 WrapperNode [2024-09-11 19:22:03,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:22:03,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:22:03,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:22:03,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:22:03,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:03" (1/1) ... [2024-09-11 19:22:03,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:03" (1/1) ... [2024-09-11 19:22:03,505 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112 [2024-09-11 19:22:03,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:22:03,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:22:03,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:22:03,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:22:03,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:03" (1/1) ... [2024-09-11 19:22:03,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:03" (1/1) ... [2024-09-11 19:22:03,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:03" (1/1) ... [2024-09-11 19:22:03,532 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-11 19:22:03,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:03" (1/1) ... [2024-09-11 19:22:03,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:03" (1/1) ... [2024-09-11 19:22:03,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:03" (1/1) ... [2024-09-11 19:22:03,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:03" (1/1) ... [2024-09-11 19:22:03,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:03" (1/1) ... [2024-09-11 19:22:03,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:03" (1/1) ... [2024-09-11 19:22:03,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:22:03,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:22:03,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:22:03,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:22:03,547 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:03" (1/1) ... [2024-09-11 19:22:03,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:22:03,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:03,584 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-11 19:22:03,588 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-11 19:22:03,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:22:03,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:22:03,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:22:03,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:22:03,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:22:03,629 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:22:03,682 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:22:03,684 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:22:03,868 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-11 19:22:03,868 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:22:03,892 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:22:03,893 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 19:22:03,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:03 BoogieIcfgContainer [2024-09-11 19:22:03,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:22:03,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:22:03,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:22:03,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:22:03,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:22:03" (1/3) ... [2024-09-11 19:22:03,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348e7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:22:03, skipping insertion in model container [2024-09-11 19:22:03,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:03" (2/3) ... [2024-09-11 19:22:03,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348e7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:22:03, skipping insertion in model container [2024-09-11 19:22:03,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:03" (3/3) ... [2024-09-11 19:22:03,903 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2024-09-11 19:22:03,918 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:22:03,919 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:22:03,972 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:22:03,978 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=All, 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;@125e11fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:22:03,979 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:22:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 30 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-11 19:22:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-11 19:22:03,988 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:03,989 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:03,989 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:03,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:03,993 INFO L85 PathProgramCache]: Analyzing trace with hash 644946439, now seen corresponding path program 1 times [2024-09-11 19:22:04,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:04,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321540129] [2024-09-11 19:22:04,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:04,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:04,227 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-11 19:22:04,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:04,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321540129] [2024-09-11 19:22:04,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321540129] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:04,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:04,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:04,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936164805] [2024-09-11 19:22:04,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:04,234 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:04,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:04,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:04,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:04,255 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 30 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) Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-11 19:22:04,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:04,426 INFO L93 Difference]: Finished difference Result 102 states and 197 transitions. [2024-09-11 19:22:04,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:04,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-11 19:22:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:04,434 INFO L225 Difference]: With dead ends: 102 [2024-09-11 19:22:04,435 INFO L226 Difference]: Without dead ends: 59 [2024-09-11 19:22:04,438 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:04,441 INFO L434 NwaCegarLoop]: 64 mSDtfsCounter, 12 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:04,442 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 225 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-11 19:22:04,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2024-09-11 19:22:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 33 states have internal predecessors, (35), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-11 19:22:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-09-11 19:22:04,495 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 12 [2024-09-11 19:22:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:04,495 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-09-11 19:22:04,495 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-11 19:22:04,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-09-11 19:22:04,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-11 19:22:04,497 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:04,497 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:04,498 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:22:04,498 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:04,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:04,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1160344907, now seen corresponding path program 1 times [2024-09-11 19:22:04,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:04,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297843305] [2024-09-11 19:22:04,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:04,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:04,674 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-11 19:22:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:04,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:04,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297843305] [2024-09-11 19:22:04,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297843305] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:04,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:04,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:22:04,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149628969] [2024-09-11 19:22:04,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:04,687 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:04,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:04,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:04,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:04,691 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:04,820 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2024-09-11 19:22:04,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:22:04,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-11 19:22:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:04,823 INFO L225 Difference]: With dead ends: 58 [2024-09-11 19:22:04,823 INFO L226 Difference]: Without dead ends: 56 [2024-09-11 19:22:04,824 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:04,825 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 15 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:04,825 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 197 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:04,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-11 19:22:04,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-09-11 19:22:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.1875) internal successors, (38), 36 states have internal predecessors, (38), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-11 19:22:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2024-09-11 19:22:04,841 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 17 [2024-09-11 19:22:04,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:04,842 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2024-09-11 19:22:04,843 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:04,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2024-09-11 19:22:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-11 19:22:04,846 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:04,847 INFO L216 NwaCegarLoop]: trace histogram [7, 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-11 19:22:04,847 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:22:04,847 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:04,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:04,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1092533038, now seen corresponding path program 1 times [2024-09-11 19:22:04,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:04,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109108471] [2024-09-11 19:22:04,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:04,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:04,905 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-11 19:22:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:04,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-11 19:22:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:04,919 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-11 19:22:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:04,925 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-11 19:22:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:04,930 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 19:22:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:04,941 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 19:22:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-11 19:22:04,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:04,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109108471] [2024-09-11 19:22:04,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109108471] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:04,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:04,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:22:04,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036442686] [2024-09-11 19:22:04,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:04,972 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:22:04,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:04,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:22:04,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:22:04,972 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-11 19:22:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:05,003 INFO L93 Difference]: Finished difference Result 85 states and 118 transitions. [2024-09-11 19:22:05,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:22:05,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2024-09-11 19:22:05,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:05,005 INFO L225 Difference]: With dead ends: 85 [2024-09-11 19:22:05,005 INFO L226 Difference]: Without dead ends: 56 [2024-09-11 19:22:05,005 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-11 19:22:05,006 INFO L434 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:05,006 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:05,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-11 19:22:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-09-11 19:22:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-11 19:22:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2024-09-11 19:22:05,020 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 46 [2024-09-11 19:22:05,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:05,021 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-09-11 19:22:05,021 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-11 19:22:05,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-09-11 19:22:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-11 19:22:05,022 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:05,022 INFO L216 NwaCegarLoop]: trace histogram [7, 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, 1] [2024-09-11 19:22:05,023 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:22:05,023 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:05,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1294632752, now seen corresponding path program 1 times [2024-09-11 19:22:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:05,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875815587] [2024-09-11 19:22:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:05,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,149 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-11 19:22:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,154 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-11 19:22:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,159 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-11 19:22:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,163 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-11 19:22:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,166 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-11 19:22:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,170 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 19:22:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-11 19:22:05,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:05,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875815587] [2024-09-11 19:22:05,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875815587] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:05,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:05,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:22:05,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900671604] [2024-09-11 19:22:05,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:05,175 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:05,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:05,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:05,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:05,176 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-11 19:22:05,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:05,289 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2024-09-11 19:22:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:22:05,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2024-09-11 19:22:05,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:05,291 INFO L225 Difference]: With dead ends: 63 [2024-09-11 19:22:05,291 INFO L226 Difference]: Without dead ends: 61 [2024-09-11 19:22:05,291 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:05,292 INFO L434 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:05,292 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 172 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:05,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-11 19:22:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-09-11 19:22:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 39 states have internal predecessors, (39), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-11 19:22:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2024-09-11 19:22:05,311 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 47 [2024-09-11 19:22:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:05,312 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2024-09-11 19:22:05,312 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-11 19:22:05,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2024-09-11 19:22:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-11 19:22:05,314 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:05,314 INFO L216 NwaCegarLoop]: trace histogram [13, 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-11 19:22:05,314 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 19:22:05,314 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:05,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:05,314 INFO L85 PathProgramCache]: Analyzing trace with hash 939016302, now seen corresponding path program 1 times [2024-09-11 19:22:05,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:05,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106173154] [2024-09-11 19:22:05,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:05,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,433 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-11 19:22:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,436 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-11 19:22:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,441 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-11 19:22:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-11 19:22:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-11 19:22:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 19:22:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 19:22:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,458 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-11 19:22:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,461 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 19:22:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,465 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 19:22:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-11 19:22:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,471 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-11 19:22:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-09-11 19:22:05,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:05,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106173154] [2024-09-11 19:22:05,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106173154] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:05,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:05,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:22:05,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111579798] [2024-09-11 19:22:05,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:05,480 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:05,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:05,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:05,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:05,481 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-09-11 19:22:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:05,547 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2024-09-11 19:22:05,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:22:05,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2024-09-11 19:22:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:05,570 INFO L225 Difference]: With dead ends: 69 [2024-09-11 19:22:05,570 INFO L226 Difference]: Without dead ends: 67 [2024-09-11 19:22:05,570 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:05,571 INFO L434 NwaCegarLoop]: 61 mSDtfsCounter, 8 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:05,571 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 210 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-11 19:22:05,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2024-09-11 19:22:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.105263157894737) internal successors, (42), 42 states have internal predecessors, (42), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-11 19:22:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2024-09-11 19:22:05,590 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 82 [2024-09-11 19:22:05,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:05,590 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2024-09-11 19:22:05,590 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-09-11 19:22:05,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2024-09-11 19:22:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-11 19:22:05,593 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:05,593 INFO L216 NwaCegarLoop]: trace histogram [14, 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-11 19:22:05,593 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-11 19:22:05,593 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:05,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:05,594 INFO L85 PathProgramCache]: Analyzing trace with hash 254908718, now seen corresponding path program 1 times [2024-09-11 19:22:05,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:05,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166231975] [2024-09-11 19:22:05,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:05,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,681 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-11 19:22:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,684 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-11 19:22:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,686 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-11 19:22:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,688 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-11 19:22:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,690 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-11 19:22:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,693 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 19:22:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 19:22:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,698 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-11 19:22:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,700 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 19:22:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,704 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 19:22:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,708 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-11 19:22:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,713 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-11 19:22:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,716 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-09-11 19:22:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-09-11 19:22:05,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:05,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166231975] [2024-09-11 19:22:05,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166231975] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:05,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:05,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:22:05,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422708950] [2024-09-11 19:22:05,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:05,720 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:05,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:05,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:05,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:05,721 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-11 19:22:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:05,788 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2024-09-11 19:22:05,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:22:05,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 87 [2024-09-11 19:22:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:05,790 INFO L225 Difference]: With dead ends: 70 [2024-09-11 19:22:05,790 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 19:22:05,790 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:05,792 INFO L434 NwaCegarLoop]: 65 mSDtfsCounter, 9 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:05,796 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 275 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 19:22:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 19:22:05,797 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-11 19:22:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 19:22:05,797 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2024-09-11 19:22:05,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:05,798 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 19:22:05,798 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-11 19:22:05,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 19:22:05,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 19:22:05,801 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 19:22:05,802 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-11 19:22:05,804 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-11 19:22:05,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 19:22:06,161 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 19:22:06,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 07:22:06 BoogieIcfgContainer [2024-09-11 19:22:06,180 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 19:22:06,180 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 19:22:06,181 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 19:22:06,181 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 19:22:06,181 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:03" (3/4) ... [2024-09-11 19:22:06,183 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 19:22:06,185 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-11 19:22:06,189 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-09-11 19:22:06,189 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-11 19:22:06,189 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 19:22:06,189 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 19:22:06,270 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 19:22:06,270 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 19:22:06,271 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 19:22:06,271 INFO L158 Benchmark]: Toolchain (without parser) took 3052.82ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 100.3MB in the beginning and 100.0MB in the end (delta: 304.1kB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2024-09-11 19:22:06,271 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 167.8MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:22:06,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.35ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 135.3MB in the end (delta: -35.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 19:22:06,272 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.15ms. Allocated memory is still 167.8MB. Free memory was 135.3MB in the beginning and 134.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:22:06,272 INFO L158 Benchmark]: Boogie Preprocessor took 39.47ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 132.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:22:06,273 INFO L158 Benchmark]: RCFGBuilder took 347.66ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 116.4MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-11 19:22:06,273 INFO L158 Benchmark]: TraceAbstraction took 2283.21ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 116.1MB in the beginning and 105.3MB in the end (delta: 10.8MB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. [2024-09-11 19:22:06,275 INFO L158 Benchmark]: Witness Printer took 90.11ms. Allocated memory is still 222.3MB. Free memory was 105.3MB in the beginning and 100.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 19:22:06,276 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.10ms. Allocated memory is still 167.8MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.35ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 135.3MB in the end (delta: -35.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.15ms. Allocated memory is still 167.8MB. Free memory was 135.3MB in the beginning and 134.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.47ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 132.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 347.66ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 116.4MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2283.21ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 116.1MB in the beginning and 105.3MB in the end (delta: 10.8MB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. * Witness Printer took 90.11ms. Allocated memory is still 222.3MB. Free memory was 105.3MB in the beginning and 100.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 1199 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 849 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 374 IncrementalHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 350 mSDtfsCounter, 374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=5, InterpolantAutomatonStates: 32, 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, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 772/772 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 1 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((long long) cp + 1) <= urilen) && (1 <= cp)) - InvariantResult [Line: 24]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((long long) cp + 1) <= urilen) && (1 <= c)) && (1 <= cp)) || (((c == 0) && (((long long) cp + 1) <= urilen)) && (1 <= cp))) - InvariantResult [Line: 25]: Location Invariant Derived location invariant: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-11 19:22:06,296 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE