./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 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/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 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:17:38,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:17:38,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:17:38,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:17:38,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:17:38,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:17:38,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:17:38,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:17:38,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:17:38,222 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:17:38,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:17:38,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:17:38,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:17:38,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:17:38,224 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:17:38,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:17:38,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:17:38,226 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:17:38,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:17:38,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:17:38,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:17:38,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:17:38,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:17:38,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:17:38,228 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:17:38,229 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:17:38,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:17:38,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:17:38,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:17:38,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:17:38,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:17:38,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:17:38,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:17:38,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:17:38,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:17:38,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:17:38,232 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:17:38,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:17:38,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:17:38,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:17:38,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:17:38,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:17:38,234 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:17:38,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:17:38,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:17:38,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:17:38,500 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:17:38,500 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:17:38,501 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-10-15 14:17:40,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:17:40,189 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:17:40,189 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2024-10-15 14:17:40,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/600e59742/9be9305331524495a7792efd1b898c24/FLAG33659039b [2024-10-15 14:17:40,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/600e59742/9be9305331524495a7792efd1b898c24 [2024-10-15 14:17:40,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:17:40,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:17:40,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:17:40,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:17:40,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:17:40,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:17:40" (1/1) ... [2024-10-15 14:17:40,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@507c10a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:40, skipping insertion in model container [2024-10-15 14:17:40,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:17:40" (1/1) ... [2024-10-15 14:17:40,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:17:40,776 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i[893,906] [2024-10-15 14:17:40,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:17:40,799 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:17:40,809 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i[893,906] [2024-10-15 14:17:40,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:17:40,829 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:17:40,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:40 WrapperNode [2024-10-15 14:17:40,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:17:40,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:17:40,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:17:40,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:17:40,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:40" (1/1) ... [2024-10-15 14:17:40,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:40" (1/1) ... [2024-10-15 14:17:40,851 INFO L138 Inliner]: procedures = 16, calls = 14, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:17:40,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:17:40,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:17:40,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:17:40,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:17:40,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:40" (1/1) ... [2024-10-15 14:17:40,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:40" (1/1) ... [2024-10-15 14:17:40,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:40" (1/1) ... [2024-10-15 14:17:40,883 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-15 14:17:40,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:40" (1/1) ... [2024-10-15 14:17:40,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:40" (1/1) ... [2024-10-15 14:17:40,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:40" (1/1) ... [2024-10-15 14:17:40,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:40" (1/1) ... [2024-10-15 14:17:40,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:40" (1/1) ... [2024-10-15 14:17:40,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:40" (1/1) ... [2024-10-15 14:17:40,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:17:40,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:17:40,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:17:40,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:17:40,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:40" (1/1) ... [2024-10-15 14:17:40,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:17:40,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:40,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-15 14:17:40,932 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-15 14:17:40,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:17:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:17:40,970 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:17:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:17:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:17:40,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:17:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:17:40,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:17:40,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:17:40,971 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:17:41,024 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:17:41,026 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:17:41,180 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-15 14:17:41,181 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:17:41,217 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:17:41,218 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-15 14:17:41,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:17:41 BoogieIcfgContainer [2024-10-15 14:17:41,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:17:41,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:17:41,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:17:41,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:17:41,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:17:40" (1/3) ... [2024-10-15 14:17:41,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4c15d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:17:41, skipping insertion in model container [2024-10-15 14:17:41,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:17:40" (2/3) ... [2024-10-15 14:17:41,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4c15d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:17:41, skipping insertion in model container [2024-10-15 14:17:41,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:17:41" (3/3) ... [2024-10-15 14:17:41,232 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2024-10-15 14:17:41,261 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:17:41,261 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:17:41,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:17:41,331 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2fa60a08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:17:41,331 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:17:41,335 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-10-15 14:17:41,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-15 14:17:41,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:41,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:41,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:41,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:41,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1996117268, now seen corresponding path program 1 times [2024-10-15 14:17:41,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:41,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067196723] [2024-10-15 14:17:41,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:41,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:41,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:41,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:41,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:41,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067196723] [2024-10-15 14:17:41,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067196723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:41,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:41,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 14:17:41,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132297353] [2024-10-15 14:17:41,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:41,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 14:17:41,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:41,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 14:17:41,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:17:41,511 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-10-15 14:17:41,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:41,553 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2024-10-15 14:17:41,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 14:17:41,555 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-10-15 14:17:41,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:41,562 INFO L225 Difference]: With dead ends: 56 [2024-10-15 14:17:41,563 INFO L226 Difference]: Without dead ends: 27 [2024-10-15 14:17:41,567 INFO L431 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-10-15 14:17:41,570 INFO L432 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-10-15 14:17:41,573 INFO L433 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-10-15 14:17:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-15 14:17:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-15 14:17:41,612 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-10-15 14:17:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-10-15 14:17:41,616 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 13 [2024-10-15 14:17:41,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:41,617 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-10-15 14:17:41,617 INFO L472 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-10-15 14:17:41,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-10-15 14:17:41,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-15 14:17:41,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:41,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:41,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:17:41,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:41,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:41,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1160645557, now seen corresponding path program 1 times [2024-10-15 14:17:41,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:41,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606507850] [2024-10-15 14:17:41,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:41,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:41,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:41,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:41,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606507850] [2024-10-15 14:17:41,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606507850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:41,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:41,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:17:41,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859086761] [2024-10-15 14:17:41,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:41,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:17:41,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:41,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:17:41,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:17:41,868 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-10-15 14:17:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:41,966 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-10-15 14:17:41,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:17:41,967 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-10-15 14:17:41,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:41,968 INFO L225 Difference]: With dead ends: 33 [2024-10-15 14:17:41,969 INFO L226 Difference]: Without dead ends: 31 [2024-10-15 14:17:41,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:41,972 INFO L432 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-10-15 14:17:41,972 INFO L433 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-10-15 14:17:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-15 14:17:41,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-15 14:17:41,990 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-10-15 14:17:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-15 14:17:41,991 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 14 [2024-10-15 14:17:41,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:41,993 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-15 14:17:41,993 INFO L472 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-10-15 14:17:41,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-15 14:17:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-15 14:17:41,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:41,996 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:41,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:17:41,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:41,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash -679603193, now seen corresponding path program 1 times [2024-10-15 14:17:41,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:41,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427282717] [2024-10-15 14:17:41,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:41,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:42,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:42,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:17:42,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:42,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427282717] [2024-10-15 14:17:42,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427282717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:42,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:42,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:42,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776934104] [2024-10-15 14:17:42,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:42,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:42,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:42,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:42,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:42,176 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-10-15 14:17:42,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:42,297 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2024-10-15 14:17:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:42,298 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-10-15 14:17:42,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:42,299 INFO L225 Difference]: With dead ends: 46 [2024-10-15 14:17:42,299 INFO L226 Difference]: Without dead ends: 44 [2024-10-15 14:17:42,299 INFO L431 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-10-15 14:17:42,300 INFO L432 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-10-15 14:17:42,301 INFO L433 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-10-15 14:17:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-15 14:17:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-10-15 14:17:42,311 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-10-15 14:17:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2024-10-15 14:17:42,312 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 19 [2024-10-15 14:17:42,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:42,312 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-10-15 14:17:42,313 INFO L472 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-10-15 14:17:42,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2024-10-15 14:17:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-15 14:17:42,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:42,314 INFO L215 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-10-15 14:17:42,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:17:42,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:42,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:42,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1179305077, now seen corresponding path program 1 times [2024-10-15 14:17:42,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:42,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662166242] [2024-10-15 14:17:42,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:42,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:42,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:42,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:17:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:42,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:17:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:17:42,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:42,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662166242] [2024-10-15 14:17:42,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662166242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:42,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:42,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:17:42,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49526615] [2024-10-15 14:17:42,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:42,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:17:42,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:42,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:17:42,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:17:42,454 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-10-15 14:17:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:42,562 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2024-10-15 14:17:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:17:42,562 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-10-15 14:17:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:42,564 INFO L225 Difference]: With dead ends: 52 [2024-10-15 14:17:42,564 INFO L226 Difference]: Without dead ends: 50 [2024-10-15 14:17:42,564 INFO L431 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-10-15 14:17:42,565 INFO L432 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-10-15 14:17:42,566 INFO L433 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-10-15 14:17:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-15 14:17:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2024-10-15 14:17:42,583 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-10-15 14:17:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2024-10-15 14:17:42,588 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 26 [2024-10-15 14:17:42,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:42,588 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-10-15 14:17:42,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-10-15 14:17:42,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-10-15 14:17:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-15 14:17:42,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:42,590 INFO L215 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-10-15 14:17:42,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-15 14:17:42,593 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:42,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:42,593 INFO L85 PathProgramCache]: Analyzing trace with hash 893389487, now seen corresponding path program 1 times [2024-10-15 14:17:42,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:42,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364725334] [2024-10-15 14:17:42,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:42,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:42,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:42,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:17:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:42,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-15 14:17:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:42,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-15 14:17:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:17:42,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:42,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364725334] [2024-10-15 14:17:42,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364725334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:42,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:42,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:42,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223213640] [2024-10-15 14:17:42,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:42,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:42,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:42,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:42,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:42,774 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-10-15 14:17:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:42,943 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2024-10-15 14:17:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:42,944 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-10-15 14:17:42,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:42,945 INFO L225 Difference]: With dead ends: 71 [2024-10-15 14:17:42,946 INFO L226 Difference]: Without dead ends: 64 [2024-10-15 14:17:42,946 INFO L431 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-10-15 14:17:42,948 INFO L432 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.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:17:42,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 96 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:17:42,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-15 14:17:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-10-15 14:17:42,965 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-10-15 14:17:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2024-10-15 14:17:42,967 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 30 [2024-10-15 14:17:42,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:42,967 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2024-10-15 14:17:42,968 INFO L472 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-10-15 14:17:42,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:42,968 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2024-10-15 14:17:42,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-15 14:17:42,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:42,969 INFO L215 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-10-15 14:17:42,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-15 14:17:42,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:42,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:42,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1072747919, now seen corresponding path program 1 times [2024-10-15 14:17:42,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:42,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420291265] [2024-10-15 14:17:42,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:42,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:43,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:43,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:17:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:43,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:17:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:43,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:17:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:17:43,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:43,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420291265] [2024-10-15 14:17:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420291265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:17:43,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:17:43,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:17:43,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100717211] [2024-10-15 14:17:43,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:17:43,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:17:43,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:43,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:17:43,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:17:43,123 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-10-15 14:17:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:43,229 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2024-10-15 14:17:43,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:17:43,231 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-10-15 14:17:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:43,232 INFO L225 Difference]: With dead ends: 72 [2024-10-15 14:17:43,232 INFO L226 Difference]: Without dead ends: 70 [2024-10-15 14:17:43,233 INFO L431 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-10-15 14:17:43,234 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-10-15 14:17:43,238 INFO L433 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-10-15 14:17:43,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-15 14:17:43,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2024-10-15 14:17:43,263 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-10-15 14:17:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2024-10-15 14:17:43,266 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 31 [2024-10-15 14:17:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:43,269 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2024-10-15 14:17:43,270 INFO L472 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-10-15 14:17:43,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2024-10-15 14:17:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-15 14:17:43,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:43,272 INFO L215 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-10-15 14:17:43,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-15 14:17:43,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:43,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:43,272 INFO L85 PathProgramCache]: Analyzing trace with hash -42548696, now seen corresponding path program 1 times [2024-10-15 14:17:43,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:43,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54896524] [2024-10-15 14:17:43,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:43,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:43,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:43,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:17:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:43,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:17:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:43,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:17:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:43,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-15 14:17:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:43,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:17:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:43,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-15 14:17:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:43,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:17:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-15 14:17:43,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:43,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54896524] [2024-10-15 14:17:43,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54896524] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:17:43,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705289251] [2024-10-15 14:17:43,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:43,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:43,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:43,517 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-10-15 14:17:43,518 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:17:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:43,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 14:17:43,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:17:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-15 14:17:43,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:17:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-15 14:17:44,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705289251] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:17:44,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:17:44,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-10-15 14:17:44,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057795483] [2024-10-15 14:17:44,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:17:44,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-15 14:17:44,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:44,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-15 14:17:44,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-10-15 14:17:44,030 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-10-15 14:17:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:44,366 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2024-10-15 14:17:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 14:17:44,367 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-10-15 14:17:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:44,369 INFO L225 Difference]: With dead ends: 103 [2024-10-15 14:17:44,371 INFO L226 Difference]: Without dead ends: 88 [2024-10-15 14:17:44,372 INFO L431 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-10-15 14:17:44,372 INFO L432 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-10-15 14:17:44,373 INFO L433 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-10-15 14:17:44,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-15 14:17:44,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-10-15 14:17:44,396 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-10-15 14:17:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2024-10-15 14:17:44,399 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 54 [2024-10-15 14:17:44,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:44,400 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2024-10-15 14:17:44,401 INFO L472 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-10-15 14:17:44,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2024-10-15 14:17:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-15 14:17:44,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:44,404 INFO L215 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-10-15 14:17:44,422 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-15 14:17:44,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-15 14:17:44,605 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:44,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:44,605 INFO L85 PathProgramCache]: Analyzing trace with hash -22060520, now seen corresponding path program 1 times [2024-10-15 14:17:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187588928] [2024-10-15 14:17:44,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:44,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:44,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:44,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:17:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:44,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:17:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:44,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:17:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:44,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-15 14:17:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:44,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:17:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:44,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:17:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:44,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:17:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:44,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-10-15 14:17:44,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:44,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187588928] [2024-10-15 14:17:44,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187588928] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:17:44,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938006642] [2024-10-15 14:17:44,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:44,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:44,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:44,728 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-10-15 14:17:44,731 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:17:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:44,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 14:17:44,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:17:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-15 14:17:44,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:17:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-15 14:17:45,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938006642] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:17:45,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:17:45,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-15 14:17:45,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439909247] [2024-10-15 14:17:45,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:17:45,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-15 14:17:45,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:45,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-15 14:17:45,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-15 14:17:45,051 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-10-15 14:17:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:45,176 INFO L93 Difference]: Finished difference Result 92 states and 110 transitions. [2024-10-15 14:17:45,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:17:45,177 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-10-15 14:17:45,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:45,179 INFO L225 Difference]: With dead ends: 92 [2024-10-15 14:17:45,179 INFO L226 Difference]: Without dead ends: 90 [2024-10-15 14:17:45,180 INFO L431 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-10-15 14:17:45,182 INFO L432 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-10-15 14:17:45,183 INFO L433 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-10-15 14:17:45,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-15 14:17:45,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-15 14:17:45,214 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-10-15 14:17:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2024-10-15 14:17:45,216 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 55 [2024-10-15 14:17:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:45,216 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2024-10-15 14:17:45,216 INFO L472 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-10-15 14:17:45,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2024-10-15 14:17:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-15 14:17:45,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:45,218 INFO L215 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-10-15 14:17:45,232 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-15 14:17:45,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:45,419 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:45,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:45,420 INFO L85 PathProgramCache]: Analyzing trace with hash -111356737, now seen corresponding path program 2 times [2024-10-15 14:17:45,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:45,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962146747] [2024-10-15 14:17:45,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:45,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:45,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:45,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:17:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:45,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:17:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:45,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:17:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:45,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-15 14:17:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:45,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:17:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:45,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:17:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:45,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:17:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:45,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:17:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:45,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 14:17:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:45,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-15 14:17:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:45,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-15 14:17:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2024-10-15 14:17:45,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:45,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962146747] [2024-10-15 14:17:45,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962146747] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:17:45,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996761936] [2024-10-15 14:17:45,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:17:45,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:45,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:45,656 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-10-15 14:17:45,658 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:17:45,717 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:17:45,717 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:17:45,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-15 14:17:45,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:17:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 22 proven. 24 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-15 14:17:45,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:17:46,121 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 22 proven. 24 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-15 14:17:46,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996761936] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:17:46,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:17:46,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2024-10-15 14:17:46,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298544411] [2024-10-15 14:17:46,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:17:46,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-15 14:17:46,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:46,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-15 14:17:46,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-10-15 14:17:46,127 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-10-15 14:17:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:46,473 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2024-10-15 14:17:46,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-15 14:17:46,474 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-10-15 14:17:46,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:46,476 INFO L225 Difference]: With dead ends: 100 [2024-10-15 14:17:46,476 INFO L226 Difference]: Without dead ends: 98 [2024-10-15 14:17:46,476 INFO L431 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-10-15 14:17:46,477 INFO L432 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-10-15 14:17:46,477 INFO L433 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-10-15 14:17:46,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-15 14:17:46,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-10-15 14:17:46,504 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-10-15 14:17:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2024-10-15 14:17:46,505 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 79 [2024-10-15 14:17:46,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:46,507 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2024-10-15 14:17:46,507 INFO L472 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-10-15 14:17:46,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:46,508 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2024-10-15 14:17:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-15 14:17:46,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:17:46,511 INFO L215 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-10-15 14:17:46,530 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 14:17:46,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-15 14:17:46,718 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:17:46,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:46,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1860395034, now seen corresponding path program 2 times [2024-10-15 14:17:46,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:17:46,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044338494] [2024-10-15 14:17:46,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:17:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:17:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:46,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:17:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:46,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:17:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:46,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:17:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:47,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:17:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:47,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-15 14:17:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:47,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:17:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:47,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:17:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:47,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:17:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:47,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:17:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:47,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 14:17:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:47,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-15 14:17:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:47,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-15 14:17:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:47,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-15 14:17:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:47,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-15 14:17:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:47,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-15 14:17:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:47,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-15 14:17:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:17:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 56 proven. 46 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-15 14:17:47,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:17:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044338494] [2024-10-15 14:17:47,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044338494] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:17:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675130519] [2024-10-15 14:17:47,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:17:47,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:47,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:17:47,110 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-10-15 14:17:47,111 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 14:17:47,193 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:17:47,193 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:17:47,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-15 14:17:47,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:17:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 64 proven. 67 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-10-15 14:17:47,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:17:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 71 proven. 60 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-10-15 14:17:47,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675130519] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:17:47,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:17:47,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 20 [2024-10-15 14:17:47,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171400000] [2024-10-15 14:17:47,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:17:47,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-15 14:17:47,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:17:47,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-15 14:17:47,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-10-15 14:17:47,602 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-10-15 14:17:47,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:17:47,921 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2024-10-15 14:17:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 14:17:47,922 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-10-15 14:17:47,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:17:47,923 INFO L225 Difference]: With dead ends: 105 [2024-10-15 14:17:47,923 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:17:47,924 INFO L431 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-10-15 14:17:47,924 INFO L432 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-10-15 14:17:47,925 INFO L433 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-10-15 14:17:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:17:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:17:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 14:17:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:17:47,927 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2024-10-15 14:17:47,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:17:47,928 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:17:47,928 INFO L472 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-10-15 14:17:47,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:17:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:17:47,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:17:47,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 14:17:47,949 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-15 14:17:48,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:17:48,138 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-15 14:17:48,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:17:49,177 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 14:17:49,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:17:49 BoogieIcfgContainer [2024-10-15 14:17:49,195 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 14:17:49,196 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 14:17:49,196 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 14:17:49,196 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 14:17:49,196 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:17:41" (3/4) ... [2024-10-15 14:17:49,198 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 14:17:49,245 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 14:17:49,246 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 14:17:49,246 INFO L158 Benchmark]: Toolchain (without parser) took 8654.99ms. Allocated memory was 172.0MB in the beginning and 276.8MB in the end (delta: 104.9MB). Free memory was 114.7MB in the beginning and 121.6MB in the end (delta: -6.9MB). Peak memory consumption was 100.3MB. Max. memory is 16.1GB. [2024-10-15 14:17:49,249 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 172.0MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:17:49,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.90ms. Allocated memory is still 172.0MB. Free memory was 114.7MB in the beginning and 102.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 14:17:49,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.65ms. Allocated memory is still 172.0MB. Free memory was 102.2MB in the beginning and 100.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:17:49,250 INFO L158 Benchmark]: Boogie Preprocessor took 48.04ms. Allocated memory is still 172.0MB. Free memory was 100.9MB in the beginning and 99.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:17:49,250 INFO L158 Benchmark]: RCFGBuilder took 317.05ms. Allocated memory is still 172.0MB. Free memory was 99.3MB in the beginning and 86.2MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-15 14:17:49,250 INFO L158 Benchmark]: TraceAbstraction took 7971.92ms. Allocated memory was 172.0MB in the beginning and 276.8MB in the end (delta: 104.9MB). Free memory was 85.4MB in the beginning and 123.6MB in the end (delta: -38.2MB). Peak memory consumption was 105.1MB. Max. memory is 16.1GB. [2024-10-15 14:17:49,251 INFO L158 Benchmark]: Witness Printer took 50.16ms. Allocated memory is still 276.8MB. Free memory was 123.6MB in the beginning and 121.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:17:49,252 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 172.0MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.90ms. Allocated memory is still 172.0MB. Free memory was 114.7MB in the beginning and 102.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.65ms. Allocated memory is still 172.0MB. Free memory was 102.2MB in the beginning and 100.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.04ms. Allocated memory is still 172.0MB. Free memory was 100.9MB in the beginning and 99.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 317.05ms. Allocated memory is still 172.0MB. Free memory was 99.3MB in the beginning and 86.2MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7971.92ms. Allocated memory was 172.0MB in the beginning and 276.8MB in the end (delta: 104.9MB). Free memory was 85.4MB in the beginning and 123.6MB in the end (delta: -38.2MB). Peak memory consumption was 105.1MB. Max. memory is 16.1GB. * Witness Printer took 50.16ms. Allocated memory is still 276.8MB. Free memory was 123.6MB in the beginning and 121.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, 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.2s 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.3s 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: 55]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((((((long long) 2 + buflim) == bufferlen) && (in == 0)) && (0 <= buflim)) && (buf == 0)) && (((long long) bufferlen + 1) <= inlen)) || ((((((((long long) bufferlen + in) + 1) <= ((long long) buf + inlen)) && (((long long) 2 + buflim) == bufferlen)) && (1 <= in)) && (0 <= buf)) && (buf <= buflim))) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-15 14:17:49,274 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE