./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.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 --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/sendmail-close-angle.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 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 --procedureinliner.inline.calls.to.implemented.procedures NEVER --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-12 15:25:34,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 15:25:34,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 15:25:34,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 15:25:34,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 15:25:34,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 15:25:34,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 15:25:34,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 15:25:34,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 15:25:34,144 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 15:25:34,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 15:25:34,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 15:25:34,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 15:25:34,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 15:25:34,146 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 15:25:34,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 15:25:34,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 15:25:34,147 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 15:25:34,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 15:25:34,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 15:25:34,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 15:25:34,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 15:25:34,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 15:25:34,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 15:25:34,152 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 15:25:34,152 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 15:25:34,153 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 15:25:34,153 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 15:25:34,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 15:25:34,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 15:25:34,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 15:25:34,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 15:25:34,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:25:34,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 15:25:34,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 15:25:34,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 15:25:34,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 15:25:34,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 15:25:34,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 15:25:34,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 15:25:34,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 15:25:34,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 15:25:34,158 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 -> 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 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 [2024-09-12 15:25:34,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 15:25:34,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 15:25:34,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 15:25:34,521 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 15:25:34,522 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 15:25:34,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2024-09-12 15:25:36,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 15:25:36,197 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 15:25:36,199 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2024-09-12 15:25:36,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/b5b2a3578/ea048093d49c4fe5bee5e53941d3fce5/FLAGdc00c4416 [2024-09-12 15:25:36,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/b5b2a3578/ea048093d49c4fe5bee5e53941d3fce5 [2024-09-12 15:25:36,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 15:25:36,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 15:25:36,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 15:25:36,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 15:25:36,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 15:25:36,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:25:36" (1/1) ... [2024-09-12 15:25:36,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@560e738f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:36, skipping insertion in model container [2024-09-12 15:25:36,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:25:36" (1/1) ... [2024-09-12 15:25:36,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 15:25:36,436 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/sendmail-close-angle.i[893,906] [2024-09-12 15:25:36,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:25:36,470 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 15:25:36,482 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/sendmail-close-angle.i[893,906] [2024-09-12 15:25:36,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:25:36,505 INFO L204 MainTranslator]: Completed translation [2024-09-12 15:25:36,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:36 WrapperNode [2024-09-12 15:25:36,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 15:25:36,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 15:25:36,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 15:25:36,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 15:25:36,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:36" (1/1) ... [2024-09-12 15:25:36,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:36" (1/1) ... [2024-09-12 15:25:36,526 INFO L138 Inliner]: procedures = 16, calls = 14, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 15:25:36,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 15:25:36,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 15:25:36,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 15:25:36,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 15:25:36,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:36" (1/1) ... [2024-09-12 15:25:36,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:36" (1/1) ... [2024-09-12 15:25:36,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:36" (1/1) ... [2024-09-12 15:25:36,553 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-12 15:25:36,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:36" (1/1) ... [2024-09-12 15:25:36,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:36" (1/1) ... [2024-09-12 15:25:36,557 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:36" (1/1) ... [2024-09-12 15:25:36,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:36" (1/1) ... [2024-09-12 15:25:36,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:36" (1/1) ... [2024-09-12 15:25:36,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:36" (1/1) ... [2024-09-12 15:25:36,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 15:25:36,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 15:25:36,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 15:25:36,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 15:25:36,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:36" (1/1) ... [2024-09-12 15:25:36,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:25:36,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:25:36,605 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-12 15:25:36,609 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-12 15:25:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 15:25:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 15:25:36,654 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 15:25:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 15:25:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 15:25:36,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 15:25:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 15:25:36,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 15:25:36,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 15:25:36,656 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 15:25:36,719 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 15:25:36,722 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 15:25:36,918 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-12 15:25:36,920 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 15:25:36,950 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 15:25:36,951 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 15:25:36,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:25:36 BoogieIcfgContainer [2024-09-12 15:25:36,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 15:25:36,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 15:25:36,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 15:25:36,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 15:25:36,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 03:25:36" (1/3) ... [2024-09-12 15:25:36,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410bc5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:25:36, skipping insertion in model container [2024-09-12 15:25:36,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:25:36" (2/3) ... [2024-09-12 15:25:36,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410bc5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:25:36, skipping insertion in model container [2024-09-12 15:25:36,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:25:36" (3/3) ... [2024-09-12 15:25:36,962 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2024-09-12 15:25:36,979 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 15:25:36,980 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 15:25:37,044 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 15:25:37,052 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;@720927a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 15:25:37,053 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 15:25:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 19 states have internal predecessors, (25), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 15:25:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 15:25:37,065 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:37,066 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:37,066 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:37,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:37,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1996117268, now seen corresponding path program 1 times [2024-09-12 15:25:37,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:37,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651721269] [2024-09-12 15:25:37,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:37,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:37,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:37,242 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-12 15:25:37,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:37,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651721269] [2024-09-12 15:25:37,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651721269] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:37,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:37,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 15:25:37,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36104724] [2024-09-12 15:25:37,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:37,250 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 15:25:37,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:37,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 15:25:37,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 15:25:37,275 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 19 states have internal predecessors, (25), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-09-12 15:25:37,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:37,320 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2024-09-12 15:25:37,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 15:25:37,323 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2024-09-12 15:25:37,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:37,330 INFO L225 Difference]: With dead ends: 56 [2024-09-12 15:25:37,330 INFO L226 Difference]: Without dead ends: 27 [2024-09-12 15:25:37,334 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 15:25:37,340 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:37,341 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:25:37,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-12 15:25:37,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-12 15:25:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 15:25:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-09-12 15:25:37,386 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 13 [2024-09-12 15:25:37,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:37,387 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-09-12 15:25:37,387 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-09-12 15:25:37,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:37,389 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-09-12 15:25:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 15:25:37,391 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:37,391 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:37,391 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 15:25:37,392 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:37,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1160645557, now seen corresponding path program 1 times [2024-09-12 15:25:37,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:37,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245987179] [2024-09-12 15:25:37,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:37,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:37,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:37,629 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-12 15:25:37,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:37,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245987179] [2024-09-12 15:25:37,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245987179] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:37,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:37,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:25:37,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538876204] [2024-09-12 15:25:37,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:37,631 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:25:37,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:37,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:25:37,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:25:37,632 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-09-12 15:25:37,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:37,743 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-09-12 15:25:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 15:25:37,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2024-09-12 15:25:37,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:37,745 INFO L225 Difference]: With dead ends: 33 [2024-09-12 15:25:37,745 INFO L226 Difference]: Without dead ends: 31 [2024-09-12 15:25:37,746 INFO L433 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-09-12 15:25:37,748 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:37,748 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 80 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-12 15:25:37,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-12 15:25:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 15:25:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-09-12 15:25:37,768 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 14 [2024-09-12 15:25:37,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:37,769 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-09-12 15:25:37,769 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-09-12 15:25:37,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:37,769 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-09-12 15:25:37,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 15:25:37,770 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:37,770 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:37,770 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 15:25:37,771 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:37,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:37,772 INFO L85 PathProgramCache]: Analyzing trace with hash -679603193, now seen corresponding path program 1 times [2024-09-12 15:25:37,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:37,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368567985] [2024-09-12 15:25:37,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:37,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:37,948 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:37,955 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 15:25:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:37,966 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-12 15:25:37,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:37,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368567985] [2024-09-12 15:25:37,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368567985] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:37,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:37,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 15:25:37,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267461984] [2024-09-12 15:25:37,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:37,971 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:25:37,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:37,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:25:37,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:25:37,973 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-09-12 15:25:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:38,120 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2024-09-12 15:25:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:25:38,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 19 [2024-09-12 15:25:38,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:38,122 INFO L225 Difference]: With dead ends: 46 [2024-09-12 15:25:38,122 INFO L226 Difference]: Without dead ends: 44 [2024-09-12 15:25:38,122 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 15:25:38,123 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:38,123 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 109 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:38,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-12 15:25:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-09-12 15:25:38,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 26 states have internal predecessors, (28), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 15:25:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2024-09-12 15:25:38,147 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 19 [2024-09-12 15:25:38,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:38,148 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-09-12 15:25:38,148 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-09-12 15:25:38,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2024-09-12 15:25:38,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 15:25:38,152 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:38,152 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:38,152 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 15:25:38,152 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:38,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:38,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1179305077, now seen corresponding path program 1 times [2024-09-12 15:25:38,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:38,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262146804] [2024-09-12 15:25:38,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:38,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:38,278 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:38,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:25:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:38,297 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 15:25:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 15:25:38,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:38,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262146804] [2024-09-12 15:25:38,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262146804] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:38,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:38,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 15:25:38,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019173175] [2024-09-12 15:25:38,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:38,309 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:25:38,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:38,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:25:38,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:25:38,310 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 15:25:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:38,431 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2024-09-12 15:25:38,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:25:38,431 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), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-09-12 15:25:38,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:38,433 INFO L225 Difference]: With dead ends: 52 [2024-09-12 15:25:38,434 INFO L226 Difference]: Without dead ends: 50 [2024-09-12 15:25:38,435 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-12 15:25:38,436 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:38,439 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 190 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-12 15:25:38,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2024-09-12 15:25:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 15:25:38,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2024-09-12 15:25:38,457 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 26 [2024-09-12 15:25:38,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:38,457 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-09-12 15:25:38,457 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 15:25:38,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-09-12 15:25:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-12 15:25:38,460 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:38,460 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:38,460 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 15:25:38,461 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:38,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:38,461 INFO L85 PathProgramCache]: Analyzing trace with hash 893389487, now seen corresponding path program 1 times [2024-09-12 15:25:38,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:38,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087549694] [2024-09-12 15:25:38,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:38,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:38,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:38,602 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 15:25:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:38,611 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 15:25:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:38,621 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-12 15:25:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 15:25:38,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:38,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087549694] [2024-09-12 15:25:38,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087549694] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:38,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:38,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:25:38,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850617368] [2024-09-12 15:25:38,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:38,634 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:25:38,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:38,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:25:38,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:38,636 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 15:25:38,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:38,831 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2024-09-12 15:25:38,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:25:38,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2024-09-12 15:25:38,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:38,833 INFO L225 Difference]: With dead ends: 71 [2024-09-12 15:25:38,835 INFO L226 Difference]: Without dead ends: 64 [2024-09-12 15:25:38,835 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:25:38,837 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:38,840 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 96 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:25:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-12 15:25:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-09-12 15:25:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 39 states have internal predecessors, (41), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-12 15:25:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2024-09-12 15:25:38,866 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 30 [2024-09-12 15:25:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:38,867 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2024-09-12 15:25:38,867 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 15:25:38,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2024-09-12 15:25:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-12 15:25:38,868 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:38,868 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:38,869 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 15:25:38,869 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:38,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:38,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1072747919, now seen corresponding path program 1 times [2024-09-12 15:25:38,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:38,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268943094] [2024-09-12 15:25:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:38,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:38,978 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:38,981 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:25:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:38,989 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 15:25:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:38,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 15:25:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 15:25:39,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:39,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268943094] [2024-09-12 15:25:39,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268943094] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:39,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:39,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:25:39,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130298586] [2024-09-12 15:25:39,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:39,015 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:25:39,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:39,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:25:39,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:39,016 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 15:25:39,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:39,117 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2024-09-12 15:25:39,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:25:39,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-09-12 15:25:39,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:39,119 INFO L225 Difference]: With dead ends: 72 [2024-09-12 15:25:39,119 INFO L226 Difference]: Without dead ends: 70 [2024-09-12 15:25:39,119 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-12 15:25:39,120 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:39,120 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 137 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:39,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-12 15:25:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-09-12 15:25:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-12 15:25:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2024-09-12 15:25:39,147 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 31 [2024-09-12 15:25:39,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:39,148 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2024-09-12 15:25:39,148 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 15:25:39,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:39,148 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2024-09-12 15:25:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-12 15:25:39,151 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:39,151 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 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-12 15:25:39,151 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 15:25:39,151 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:39,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:39,152 INFO L85 PathProgramCache]: Analyzing trace with hash -42548696, now seen corresponding path program 1 times [2024-09-12 15:25:39,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:39,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474245319] [2024-09-12 15:25:39,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:39,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:39,402 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:39,407 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:25:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:39,414 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 15:25:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:39,420 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 15:25:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:39,425 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-12 15:25:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:39,431 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-12 15:25:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:39,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-12 15:25:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:39,450 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-12 15:25:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-12 15:25:39,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:39,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474245319] [2024-09-12 15:25:39,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474245319] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:25:39,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682894640] [2024-09-12 15:25:39,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:39,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:39,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:25:39,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:25:39,463 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 15:25:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:39,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 15:25:39,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:25:39,811 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-12 15:25:39,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:25:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-12 15:25:40,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682894640] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:25:40,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:25:40,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-09-12 15:25:40,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274814728] [2024-09-12 15:25:40,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:25:40,005 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-12 15:25:40,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:40,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-12 15:25:40,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-09-12 15:25:40,007 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 17 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-09-12 15:25:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:40,334 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2024-09-12 15:25:40,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 15:25:40,334 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) Word has length 54 [2024-09-12 15:25:40,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:40,336 INFO L225 Difference]: With dead ends: 103 [2024-09-12 15:25:40,336 INFO L226 Difference]: Without dead ends: 88 [2024-09-12 15:25:40,337 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 111 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2024-09-12 15:25:40,340 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 53 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:40,341 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 193 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:25:40,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-12 15:25:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-09-12 15:25:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 50 states have (on average 1.1) internal successors, (55), 53 states have internal predecessors, (55), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-12 15:25:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2024-09-12 15:25:40,374 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 54 [2024-09-12 15:25:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:40,374 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2024-09-12 15:25:40,374 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-09-12 15:25:40,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2024-09-12 15:25:40,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-12 15:25:40,379 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:40,379 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:40,398 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 15:25:40,579 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-12 15:25:40,580 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:40,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:40,581 INFO L85 PathProgramCache]: Analyzing trace with hash -22060520, now seen corresponding path program 1 times [2024-09-12 15:25:40,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:40,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275655485] [2024-09-12 15:25:40,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:40,701 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:40,704 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:25:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:40,707 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 15:25:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:40,711 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 15:25:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:40,714 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-12 15:25:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:40,717 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 15:25:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:40,720 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-12 15:25:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:40,722 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-12 15:25:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:40,726 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-12 15:25:40,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:40,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275655485] [2024-09-12 15:25:40,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275655485] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:25:40,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568967085] [2024-09-12 15:25:40,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:40,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:40,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:25:40,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:25:40,730 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 15:25:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:40,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-12 15:25:40,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:25:40,928 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-12 15:25:40,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:25:41,034 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-12 15:25:41,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568967085] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:25:41,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:25:41,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-09-12 15:25:41,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171810479] [2024-09-12 15:25:41,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:25:41,038 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-12 15:25:41,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:41,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-12 15:25:41,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-09-12 15:25:41,039 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 8 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-09-12 15:25:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:41,157 INFO L93 Difference]: Finished difference Result 92 states and 110 transitions. [2024-09-12 15:25:41,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:41,158 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 8 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) Word has length 55 [2024-09-12 15:25:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:41,160 INFO L225 Difference]: With dead ends: 92 [2024-09-12 15:25:41,163 INFO L226 Difference]: Without dead ends: 90 [2024-09-12 15:25:41,164 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 115 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-09-12 15:25:41,164 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 29 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:41,165 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 198 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-09-12 15:25:41,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-09-12 15:25:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 56 states have internal predecessors, (58), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-12 15:25:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2024-09-12 15:25:41,188 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 55 [2024-09-12 15:25:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:41,189 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2024-09-12 15:25:41,190 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 8 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-09-12 15:25:41,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2024-09-12 15:25:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-09-12 15:25:41,191 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:41,191 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:41,210 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 15:25:41,392 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:41,392 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:41,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:41,393 INFO L85 PathProgramCache]: Analyzing trace with hash -111356737, now seen corresponding path program 2 times [2024-09-12 15:25:41,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:41,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840209609] [2024-09-12 15:25:41,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:41,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:41,565 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:41,568 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:25:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:41,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 15:25:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:41,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 15:25:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:41,579 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-12 15:25:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:41,582 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 15:25:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:41,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-12 15:25:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:41,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-12 15:25:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:41,590 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-12 15:25:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:41,594 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-12 15:25:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:41,597 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-12 15:25:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:41,614 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-12 15:25:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2024-09-12 15:25:41,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:41,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840209609] [2024-09-12 15:25:41,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840209609] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:25:41,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304260337] [2024-09-12 15:25:41,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 15:25:41,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:41,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:25:41,620 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:25:41,621 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 15:25:41,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 15:25:41,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:25:41,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-12 15:25:41,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:25:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 22 proven. 24 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-12 15:25:41,921 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:25:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 22 proven. 24 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-12 15:25:42,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304260337] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:25:42,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:25:42,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2024-09-12 15:25:42,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693174243] [2024-09-12 15:25:42,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:25:42,093 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-12 15:25:42,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:42,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-12 15:25:42,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-09-12 15:25:42,096 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 11 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) [2024-09-12 15:25:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:42,448 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2024-09-12 15:25:42,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-12 15:25:42,448 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 11 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) Word has length 79 [2024-09-12 15:25:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:42,450 INFO L225 Difference]: With dead ends: 100 [2024-09-12 15:25:42,450 INFO L226 Difference]: Without dead ends: 98 [2024-09-12 15:25:42,450 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2024-09-12 15:25:42,451 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 53 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:42,451 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 187 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:25:42,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-09-12 15:25:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-09-12 15:25:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 59 states have internal predecessors, (61), 26 states have call successors, (26), 12 states have call predecessors, (26), 11 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-12 15:25:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2024-09-12 15:25:42,473 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 79 [2024-09-12 15:25:42,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:42,474 INFO L474 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2024-09-12 15:25:42,474 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 11 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) [2024-09-12 15:25:42,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2024-09-12 15:25:42,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-09-12 15:25:42,478 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:42,478 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:42,496 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 15:25:42,679 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-12 15:25:42,679 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:25:42,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:42,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1860395034, now seen corresponding path program 2 times [2024-09-12 15:25:42,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:42,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778770580] [2024-09-12 15:25:42,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:42,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:42,979 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:42,982 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:25:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:42,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 15:25:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:42,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 15:25:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:42,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-12 15:25:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:43,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 15:25:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:43,010 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-12 15:25:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:43,021 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-12 15:25:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:43,028 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-12 15:25:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:43,038 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-12 15:25:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:43,041 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-12 15:25:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:43,060 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-12 15:25:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:43,067 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-12 15:25:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:43,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-09-12 15:25:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:43,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-12 15:25:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:43,080 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-12 15:25:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 56 proven. 46 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-09-12 15:25:43,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:43,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778770580] [2024-09-12 15:25:43,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778770580] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:25:43,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858890236] [2024-09-12 15:25:43,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 15:25:43,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:43,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:25:43,086 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:25:43,087 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 15:25:43,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 15:25:43,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:25:43,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-12 15:25:43,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:25:43,318 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 64 proven. 67 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-09-12 15:25:43,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:25:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 71 proven. 60 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-09-12 15:25:43,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858890236] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:25:43,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:25:43,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 20 [2024-09-12 15:25:43,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818159761] [2024-09-12 15:25:43,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:25:43,528 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-12 15:25:43,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:43,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-12 15:25:43,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-09-12 15:25:43,529 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 12 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (26), 11 states have call predecessors, (26), 12 states have call successors, (26) [2024-09-12 15:25:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:43,869 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2024-09-12 15:25:43,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 15:25:43,869 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 12 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (26), 11 states have call predecessors, (26), 12 states have call successors, (26) Word has length 102 [2024-09-12 15:25:43,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:43,870 INFO L225 Difference]: With dead ends: 105 [2024-09-12 15:25:43,870 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 15:25:43,872 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 227 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2024-09-12 15:25:43,872 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:43,872 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 234 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:25:43,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 15:25:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 15:25:43,873 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-12 15:25:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 15:25:43,874 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2024-09-12 15:25:43,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:43,874 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 15:25:43,874 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 12 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (26), 11 states have call predecessors, (26), 12 states have call successors, (26) [2024-09-12 15:25:43,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 15:25:43,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 15:25:43,877 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 15:25:43,895 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-12 15:25:44,078 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:25:44,081 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:44,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 15:25:45,187 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 15:25:45,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 03:25:45 BoogieIcfgContainer [2024-09-12 15:25:45,200 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 15:25:45,201 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 15:25:45,201 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 15:25:45,201 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 15:25:45,201 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:25:36" (3/4) ... [2024-09-12 15:25:45,203 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 15:25:45,206 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 15:25:45,207 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 15:25:45,207 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 15:25:45,211 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-09-12 15:25:45,211 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-09-12 15:25:45,211 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-12 15:25:45,212 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 15:25:45,302 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 15:25:45,305 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 15:25:45,305 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 15:25:45,306 INFO L158 Benchmark]: Toolchain (without parser) took 9073.03ms. Allocated memory was 62.9MB in the beginning and 161.5MB in the end (delta: 98.6MB). Free memory was 32.5MB in the beginning and 84.4MB in the end (delta: -51.9MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2024-09-12 15:25:45,306 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 46.1MB. Free memory was 27.3MB in the beginning and 27.3MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:25:45,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.84ms. Allocated memory is still 62.9MB. Free memory was 32.3MB in the beginning and 37.0MB in the end (delta: -4.6MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-09-12 15:25:45,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.64ms. Allocated memory is still 62.9MB. Free memory was 37.0MB in the beginning and 36.1MB in the end (delta: 867.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 15:25:45,306 INFO L158 Benchmark]: Boogie Preprocessor took 42.01ms. Allocated memory is still 62.9MB. Free memory was 36.1MB in the beginning and 34.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:25:45,307 INFO L158 Benchmark]: RCFGBuilder took 381.54ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 34.3MB in the beginning and 51.3MB in the end (delta: -17.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 15:25:45,307 INFO L158 Benchmark]: TraceAbstraction took 8247.10ms. Allocated memory was 75.5MB in the beginning and 161.5MB in the end (delta: 86.0MB). Free memory was 50.7MB in the beginning and 88.6MB in the end (delta: -37.9MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. [2024-09-12 15:25:45,307 INFO L158 Benchmark]: Witness Printer took 104.31ms. Allocated memory is still 161.5MB. Free memory was 88.6MB in the beginning and 84.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 15:25:45,309 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 46.1MB. Free memory was 27.3MB in the beginning and 27.3MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.84ms. Allocated memory is still 62.9MB. Free memory was 32.3MB in the beginning and 37.0MB in the end (delta: -4.6MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.64ms. Allocated memory is still 62.9MB. Free memory was 37.0MB in the beginning and 36.1MB in the end (delta: 867.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.01ms. Allocated memory is still 62.9MB. Free memory was 36.1MB in the beginning and 34.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 381.54ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 34.3MB in the beginning and 51.3MB in the end (delta: -17.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8247.10ms. Allocated memory was 75.5MB in the beginning and 161.5MB in the end (delta: 86.0MB). Free memory was 50.7MB in the beginning and 88.6MB in the end (delta: -37.9MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. * Witness Printer took 104.31ms. Allocated memory is still 161.5MB. Free memory was 88.6MB in the beginning and 84.4MB in the end (delta: 4.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 4 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 1463 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1160 mSDsCounter, 219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 962 IncrementalHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 219 mSolverCounterUnsat, 303 mSDtfsCounter, 962 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 804 GetRequests, 665 SyntacticMatches, 18 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=9, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 985 ConstructedInterpolants, 0 QuantifiedInterpolants, 2990 SizeOfPredicates, 14 NumberOfNonLiveVariables, 628 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 2630/2902 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: 37]: Loop Invariant Derived loop invariant: (((((((2 + buflim) == bufferlen) && (in == 0)) && (0 <= buflim)) && (buf == 0)) && (((long long) bufferlen + 1) <= inlen)) || (((((((bufferlen + in) + 1) <= (buf + inlen)) && ((2 + buflim) == bufferlen)) && (1 <= in)) && (0 <= buf)) && (buf <= buflim))) - 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-12 15:25:45,331 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