./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:16:53,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:16:53,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:16:53,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:16:53,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:16:53,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:16:53,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:16:53,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:16:53,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:16:53,342 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:16:53,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:16:53,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:16:53,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:16:53,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:16:53,344 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:16:53,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:16:53,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:16:53,345 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:16:53,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:16:53,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:16:53,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:16:53,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:16:53,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:16:53,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:16:53,348 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:16:53,348 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:16:53,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:16:53,348 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:16:53,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:16:53,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:16:53,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:16:53,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:16:53,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:16:53,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:16:53,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:16:53,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:16:53,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:16:53,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:16:53,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:16:53,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:16:53,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:16:53,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:16:53,353 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.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:16:53,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:16:53,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:16:53,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:16:53,673 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:16:53,674 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:16:53,675 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-10-15 14:16:55,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:16:55,288 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:16:55,290 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2024-10-15 14:16:55,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/0a2f431ae/ab60a8ef5c0f470e86692b62cd732854/FLAG5733ff57e [2024-10-15 14:16:55,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/0a2f431ae/ab60a8ef5c0f470e86692b62cd732854 [2024-10-15 14:16:55,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:16:55,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:16:55,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:16:55,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:16:55,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:16:55,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:16:55" (1/1) ... [2024-10-15 14:16:55,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@775becc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:55, skipping insertion in model container [2024-10-15 14:16:55,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:16:55" (1/1) ... [2024-10-15 14:16:55,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:16:55,533 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-10-15 14:16:55,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:16:55,565 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:16:55,576 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-10-15 14:16:55,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:16:55,608 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:16:55,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:55 WrapperNode [2024-10-15 14:16:55,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:16:55,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:16:55,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:16:55,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:16:55,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:55" (1/1) ... [2024-10-15 14:16:55,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:55" (1/1) ... [2024-10-15 14:16:55,633 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:16:55,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:16:55,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:16:55,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:16:55,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:16:55,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:55" (1/1) ... [2024-10-15 14:16:55,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:55" (1/1) ... [2024-10-15 14:16:55,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:55" (1/1) ... [2024-10-15 14:16:55,663 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-10-15 14:16:55,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:55" (1/1) ... [2024-10-15 14:16:55,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:55" (1/1) ... [2024-10-15 14:16:55,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:55" (1/1) ... [2024-10-15 14:16:55,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:55" (1/1) ... [2024-10-15 14:16:55,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:55" (1/1) ... [2024-10-15 14:16:55,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:55" (1/1) ... [2024-10-15 14:16:55,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:16:55,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:16:55,680 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:16:55,680 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:16:55,681 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:55" (1/1) ... [2024-10-15 14:16:55,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:16:55,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:16:55,730 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-10-15 14:16:55,734 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-10-15 14:16:55,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:16:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:16:55,781 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:16:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:16:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:16:55,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:16:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:16:55,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:16:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:16:55,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:16:55,883 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:16:55,887 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:16:56,099 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-15 14:16:56,099 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:16:56,130 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:16:56,132 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 14:16:56,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:16:56 BoogieIcfgContainer [2024-10-15 14:16:56,133 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:16:56,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:16:56,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:16:56,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:16:56,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:16:55" (1/3) ... [2024-10-15 14:16:56,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a22b9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:16:56, skipping insertion in model container [2024-10-15 14:16:56,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:55" (2/3) ... [2024-10-15 14:16:56,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a22b9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:16:56, skipping insertion in model container [2024-10-15 14:16:56,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:16:56" (3/3) ... [2024-10-15 14:16:56,143 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2024-10-15 14:16:56,159 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:16:56,159 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:16:56,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:16:56,230 INFO L333 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;@3d3e4631, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:16:56,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:16:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 32 states have internal predecessors, (47), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-15 14:16:56,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:16:56,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:16:56,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:16:56,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:16:56,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:56,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1997840557, now seen corresponding path program 1 times [2024-10-15 14:16:56,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:16:56,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002756828] [2024-10-15 14:16:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:56,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:16:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:56,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:16:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:16:56,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:16:56,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002756828] [2024-10-15 14:16:56,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002756828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:16:56,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:16:56,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:16:56,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579424375] [2024-10-15 14:16:56,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:16:56,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:16:56,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:16:56,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:16:56,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:16:56,621 INFO L87 Difference]: Start difference. First operand has 53 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 32 states have internal predecessors, (47), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:56,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:16:56,785 INFO L93 Difference]: Finished difference Result 111 states and 206 transitions. [2024-10-15 14:16:56,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:16:56,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-15 14:16:56,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:16:56,799 INFO L225 Difference]: With dead ends: 111 [2024-10-15 14:16:56,799 INFO L226 Difference]: Without dead ends: 63 [2024-10-15 14:16:56,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-10-15 14:16:56,806 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 13 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:16:56,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 259 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:16:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-15 14:16:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2024-10-15 14:16:56,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.2) internal successors, (36), 34 states have internal predecessors, (36), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-15 14:16:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2024-10-15 14:16:56,849 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 16 [2024-10-15 14:16:56,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:16:56,850 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2024-10-15 14:16:56,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:56,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2024-10-15 14:16:56,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-15 14:16:56,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:16:56,853 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:16:56,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:16:56,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:16:56,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:56,854 INFO L85 PathProgramCache]: Analyzing trace with hash 348964071, now seen corresponding path program 1 times [2024-10-15 14:16:56,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:16:56,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680544251] [2024-10-15 14:16:56,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:56,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:16:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:16:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:16:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:16:57,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:16:57,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680544251] [2024-10-15 14:16:57,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680544251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:16:57,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:16:57,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:16:57,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444495902] [2024-10-15 14:16:57,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:16:57,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:16:57,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:16:57,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:16:57,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:16:57,029 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 14:16:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:16:57,171 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2024-10-15 14:16:57,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:16:57,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-10-15 14:16:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:16:57,176 INFO L225 Difference]: With dead ends: 62 [2024-10-15 14:16:57,177 INFO L226 Difference]: Without dead ends: 60 [2024-10-15 14:16:57,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-10-15 14:16:57,179 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 15 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:16:57,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 215 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:16:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-15 14:16:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-15 14:16:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 37 states have internal predecessors, (39), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-15 14:16:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2024-10-15 14:16:57,203 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 21 [2024-10-15 14:16:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:16:57,204 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2024-10-15 14:16:57,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 14:16:57,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2024-10-15 14:16:57,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-15 14:16:57,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:16:57,207 INFO L215 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, 1, 1, 1] [2024-10-15 14:16:57,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:16:57,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:16:57,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:57,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2112377310, now seen corresponding path program 1 times [2024-10-15 14:16:57,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:16:57,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327355449] [2024-10-15 14:16:57,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:57,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:16:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:16:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:16:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:16:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-15 14:16:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:16:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:16:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:16:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-15 14:16:57,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:16:57,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327355449] [2024-10-15 14:16:57,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327355449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:16:57,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:16:57,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 14:16:57,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488880894] [2024-10-15 14:16:57,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:16:57,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-15 14:16:57,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:16:57,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 14:16:57,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:16:57,334 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-15 14:16:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:16:57,372 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2024-10-15 14:16:57,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 14:16:57,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2024-10-15 14:16:57,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:16:57,377 INFO L225 Difference]: With dead ends: 89 [2024-10-15 14:16:57,377 INFO L226 Difference]: Without dead ends: 60 [2024-10-15 14:16:57,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-10-15 14:16:57,379 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:16:57,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:16:57,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-15 14:16:57,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-15 14:16:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.121212121212121) internal successors, (37), 37 states have internal predecessors, (37), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-15 14:16:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2024-10-15 14:16:57,399 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 50 [2024-10-15 14:16:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:16:57,400 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2024-10-15 14:16:57,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-15 14:16:57,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2024-10-15 14:16:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-15 14:16:57,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:16:57,404 INFO L215 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, 1, 1, 1, 1] [2024-10-15 14:16:57,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:16:57,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:16:57,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:57,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1527746620, now seen corresponding path program 1 times [2024-10-15 14:16:57,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:16:57,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357601784] [2024-10-15 14:16:57,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:57,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:16:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:16:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:16:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:16:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-15 14:16:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:16:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-15 14:16:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-15 14:16:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-15 14:16:57,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:16:57,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357601784] [2024-10-15 14:16:57,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357601784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:16:57,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:16:57,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:16:57,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669593886] [2024-10-15 14:16:57,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:16:57,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:16:57,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:16:57,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:16:57,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:16:57,666 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-15 14:16:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:16:57,783 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2024-10-15 14:16:57,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:16:57,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 51 [2024-10-15 14:16:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:16:57,785 INFO L225 Difference]: With dead ends: 67 [2024-10-15 14:16:57,785 INFO L226 Difference]: Without dead ends: 65 [2024-10-15 14:16:57,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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-10-15 14:16:57,787 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 16 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:16:57,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 162 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:16:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-15 14:16:57,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2024-10-15 14:16:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 40 states have internal predecessors, (40), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-15 14:16:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2024-10-15 14:16:57,808 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 51 [2024-10-15 14:16:57,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:16:57,809 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2024-10-15 14:16:57,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-15 14:16:57,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2024-10-15 14:16:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-15 14:16:57,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:16:57,814 INFO L215 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, 1, 1, 1, 1] [2024-10-15 14:16:57,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-15 14:16:57,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:16:57,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:57,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1740534074, now seen corresponding path program 1 times [2024-10-15 14:16:57,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:16:57,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789280192] [2024-10-15 14:16:57,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:57,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:16:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:16:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:16:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:16:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-15 14:16:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:16:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-15 14:16:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-15 14:16:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-15 14:16:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-15 14:16:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 14:16:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-15 14:16:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-15 14:16:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-15 14:16:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-15 14:16:57,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:16:57,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789280192] [2024-10-15 14:16:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789280192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:16:57,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:16:57,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:16:57,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704969860] [2024-10-15 14:16:57,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:16:57,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:16:57,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:16:57,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:16:57,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:16:57,975 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-15 14:16:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:16:58,058 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2024-10-15 14:16:58,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:16:58,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2024-10-15 14:16:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:16:58,062 INFO L225 Difference]: With dead ends: 73 [2024-10-15 14:16:58,063 INFO L226 Difference]: Without dead ends: 71 [2024-10-15 14:16:58,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 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-10-15 14:16:58,065 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:16:58,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 277 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:16:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-15 14:16:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2024-10-15 14:16:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 43 states have internal predecessors, (43), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-15 14:16:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2024-10-15 14:16:58,080 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 86 [2024-10-15 14:16:58,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:16:58,082 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2024-10-15 14:16:58,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-15 14:16:58,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2024-10-15 14:16:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-15 14:16:58,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:16:58,085 INFO L215 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, 1, 1, 1, 1] [2024-10-15 14:16:58,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-15 14:16:58,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:16:58,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:58,086 INFO L85 PathProgramCache]: Analyzing trace with hash 268638176, now seen corresponding path program 1 times [2024-10-15 14:16:58,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:16:58,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374949823] [2024-10-15 14:16:58,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:58,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:16:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:58,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:16:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:58,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:16:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:58,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:16:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:58,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-15 14:16:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:58,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-15 14:16:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:58,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-15 14:16:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:58,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-15 14:16:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:58,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-15 14:16:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:58,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-15 14:16:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:58,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 14:16:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:58,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-15 14:16:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:58,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-15 14:16:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:58,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-15 14:16:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:58,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-15 14:16:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-15 14:16:58,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:16:58,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374949823] [2024-10-15 14:16:58,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374949823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:16:58,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:16:58,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:16:58,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076129139] [2024-10-15 14:16:58,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:16:58,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:16:58,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:16:58,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:16:58,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:16:58,304 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-15 14:16:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:16:58,402 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2024-10-15 14:16:58,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:16:58,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 91 [2024-10-15 14:16:58,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:16:58,404 INFO L225 Difference]: With dead ends: 74 [2024-10-15 14:16:58,404 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:16:58,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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-10-15 14:16:58,407 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:16:58,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 293 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:16:58,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:16:58,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:16:58,412 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-10-15 14:16:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:16:58,413 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2024-10-15 14:16:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:16:58,413 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:16:58,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-15 14:16:58,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:16:58,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:16:58,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 14:16:58,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-15 14:16:58,422 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-15 14:16:58,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:16:58,879 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 14:16:58,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:16:58 BoogieIcfgContainer [2024-10-15 14:16:58,907 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 14:16:58,907 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 14:16:58,908 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 14:16:58,910 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 14:16:58,911 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:16:56" (3/4) ... [2024-10-15 14:16:58,913 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 14:16:58,964 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 14:16:58,964 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 14:16:58,965 INFO L158 Benchmark]: Toolchain (without parser) took 3642.81ms. Allocated memory was 186.6MB in the beginning and 237.0MB in the end (delta: 50.3MB). Free memory was 137.3MB in the beginning and 130.6MB in the end (delta: 6.7MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2024-10-15 14:16:58,966 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 107.0MB. Free memory was 67.3MB in the beginning and 67.2MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:16:58,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.20ms. Allocated memory is still 186.6MB. Free memory was 136.7MB in the beginning and 124.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 14:16:58,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.19ms. Allocated memory is still 186.6MB. Free memory was 123.5MB in the beginning and 122.9MB in the end (delta: 583.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:16:58,969 INFO L158 Benchmark]: Boogie Preprocessor took 44.94ms. Allocated memory is still 186.6MB. Free memory was 122.9MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:16:58,969 INFO L158 Benchmark]: RCFGBuilder took 452.63ms. Allocated memory is still 186.6MB. Free memory was 120.8MB in the beginning and 145.1MB in the end (delta: -24.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-15 14:16:58,969 INFO L158 Benchmark]: TraceAbstraction took 2771.95ms. Allocated memory was 186.6MB in the beginning and 237.0MB in the end (delta: 50.3MB). Free memory was 145.1MB in the beginning and 132.7MB in the end (delta: 12.4MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2024-10-15 14:16:58,970 INFO L158 Benchmark]: Witness Printer took 57.58ms. Allocated memory is still 237.0MB. Free memory was 132.7MB in the beginning and 130.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:16:58,971 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.19ms. Allocated memory is still 107.0MB. Free memory was 67.3MB in the beginning and 67.2MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.20ms. Allocated memory is still 186.6MB. Free memory was 136.7MB in the beginning and 124.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.19ms. Allocated memory is still 186.6MB. Free memory was 123.5MB in the beginning and 122.9MB in the end (delta: 583.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.94ms. Allocated memory is still 186.6MB. Free memory was 122.9MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 452.63ms. Allocated memory is still 186.6MB. Free memory was 120.8MB in the beginning and 145.1MB in the end (delta: -24.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2771.95ms. Allocated memory was 186.6MB in the beginning and 237.0MB in the end (delta: 50.3MB). Free memory was 145.1MB in the beginning and 132.7MB in the end (delta: 12.4MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. * Witness Printer took 57.58ms. Allocated memory is still 237.0MB. Free memory was 132.7MB in the beginning and 130.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 4 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 1332 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 954 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 376 IncrementalHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 378 mSDtfsCounter, 376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred 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, 1.0s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 309 ConstructedInterpolants, 0 QuantifiedInterpolants, 470 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: 25]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((long long) cp + 1) <= urilen) && (c == 0)) && (1 <= cp)) || (((1 <= c) && (((long long) cp + 1) <= urilen)) && (1 <= cp))) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((long long) cp + 1) <= urilen) && (1 <= cp)) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-15 14:16:59,004 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