./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/trex03-2_abstracted.c --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 f1d7dc9d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/trex03-2_abstracted.c -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 25ec36157cae05963a6c18a739b5ec777339c87a162ad2e43daaca83e0e91f82 --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.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 11:56:57,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 11:56:57,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 11:56:57,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 11:56:57,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 11:56:57,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 11:56:57,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 11:56:57,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 11:56:57,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 11:56:57,130 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 11:56:57,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 11:56:57,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 11:56:57,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 11:56:57,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 11:56:57,131 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 11:56:57,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 11:56:57,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 11:56:57,132 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 11:56:57,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 11:56:57,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 11:56:57,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 11:56:57,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 11:56:57,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 11:56:57,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 11:56:57,134 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 11:56:57,134 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 11:56:57,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 11:56:57,135 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 11:56:57,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 11:56:57,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 11:56:57,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 11:56:57,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 11:56:57,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 11:56:57,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 11:56:57,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 11:56:57,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 11:56:57,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 11:56:57,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 11:56:57,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 11:56:57,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 11:56:57,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 11:56:57,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 11:56:57,138 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 -> 25ec36157cae05963a6c18a739b5ec777339c87a162ad2e43daaca83e0e91f82 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-09-20 11:56:57,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 11:56:57,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 11:56:57,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 11:56:57,352 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 11:56:57,353 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 11:56:57,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops/trex03-2_abstracted.c [2024-09-20 11:56:58,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 11:56:58,667 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 11:56:58,667 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/trex03-2_abstracted.c [2024-09-20 11:56:58,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/1ee1387ad/1fb014f678104a44a5b66e42d9ff9e5d/FLAG3ccfa0090 [2024-09-20 11:56:59,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/1ee1387ad/1fb014f678104a44a5b66e42d9ff9e5d [2024-09-20 11:56:59,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 11:56:59,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 11:56:59,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 11:56:59,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 11:56:59,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 11:56:59,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 11:56:59" (1/1) ... [2024-09-20 11:56:59,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21dfc346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:59, skipping insertion in model container [2024-09-20 11:56:59,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 11:56:59" (1/1) ... [2024-09-20 11:56:59,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 11:56:59,225 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/loops/trex03-2_abstracted.c[738,751] [2024-09-20 11:56:59,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 11:56:59,246 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 11:56:59,257 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/loops/trex03-2_abstracted.c[738,751] [2024-09-20 11:56:59,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 11:56:59,293 INFO L204 MainTranslator]: Completed translation [2024-09-20 11:56:59,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:59 WrapperNode [2024-09-20 11:56:59,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 11:56:59,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 11:56:59,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 11:56:59,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 11:56:59,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:59" (1/1) ... [2024-09-20 11:56:59,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:59" (1/1) ... [2024-09-20 11:56:59,321 INFO L138 Inliner]: procedures = 20, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 11:56:59,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 11:56:59,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 11:56:59,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 11:56:59,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 11:56:59,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:59" (1/1) ... [2024-09-20 11:56:59,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:59" (1/1) ... [2024-09-20 11:56:59,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:59" (1/1) ... [2024-09-20 11:56:59,353 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-20 11:56:59,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:59" (1/1) ... [2024-09-20 11:56:59,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:59" (1/1) ... [2024-09-20 11:56:59,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:59" (1/1) ... [2024-09-20 11:56:59,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:59" (1/1) ... [2024-09-20 11:56:59,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:59" (1/1) ... [2024-09-20 11:56:59,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:59" (1/1) ... [2024-09-20 11:56:59,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 11:56:59,369 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 11:56:59,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 11:56:59,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 11:56:59,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:59" (1/1) ... [2024-09-20 11:56:59,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 11:56:59,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 11:56:59,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-20 11:56:59,407 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-20 11:56:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 11:56:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 11:56:59,438 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 11:56:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 11:56:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 11:56:59,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 11:56:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 11:56:59,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 11:56:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 11:56:59,439 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 11:56:59,489 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 11:56:59,491 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 11:56:59,713 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-09-20 11:56:59,716 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 11:56:59,734 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 11:56:59,735 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-20 11:56:59,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:56:59 BoogieIcfgContainer [2024-09-20 11:56:59,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 11:56:59,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 11:56:59,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 11:56:59,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 11:56:59,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 11:56:59" (1/3) ... [2024-09-20 11:56:59,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e47b59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 11:56:59, skipping insertion in model container [2024-09-20 11:56:59,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:59" (2/3) ... [2024-09-20 11:56:59,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e47b59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 11:56:59, skipping insertion in model container [2024-09-20 11:56:59,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:56:59" (3/3) ... [2024-09-20 11:56:59,743 INFO L112 eAbstractionObserver]: Analyzing ICFG trex03-2_abstracted.c [2024-09-20 11:56:59,757 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 11:56:59,757 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 11:56:59,804 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 11:56:59,810 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e431c7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 11:56:59,811 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 11:56:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-20 11:56:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-20 11:56:59,819 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:56:59,820 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 11:56:59,820 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:56:59,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:56:59,825 INFO L85 PathProgramCache]: Analyzing trace with hash 342776240, now seen corresponding path program 1 times [2024-09-20 11:56:59,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:56:59,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94440441] [2024-09-20 11:56:59,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:56:59,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:56:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:00,033 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:57:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 11:57:00,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:57:00,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94440441] [2024-09-20 11:57:00,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94440441] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 11:57:00,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 11:57:00,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 11:57:00,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666730276] [2024-09-20 11:57:00,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 11:57:00,049 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 11:57:00,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:57:00,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 11:57:00,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 11:57:00,069 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:00,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:57:00,107 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2024-09-20 11:57:00,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 11:57:00,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 15 [2024-09-20 11:57:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:57:00,114 INFO L225 Difference]: With dead ends: 49 [2024-09-20 11:57:00,115 INFO L226 Difference]: Without dead ends: 25 [2024-09-20 11:57:00,118 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 11:57:00,121 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 11:57:00,123 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 11:57:00,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-20 11:57:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-09-20 11:57:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:00,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2024-09-20 11:57:00,163 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 15 [2024-09-20 11:57:00,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:57:00,163 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-09-20 11:57:00,163 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:00,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:00,164 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2024-09-20 11:57:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-20 11:57:00,166 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:57:00,167 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 11:57:00,167 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 11:57:00,167 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:57:00,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash -466570386, now seen corresponding path program 1 times [2024-09-20 11:57:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:57:00,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798140954] [2024-09-20 11:57:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:57:00,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:57:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:00,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:57:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 11:57:00,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:57:00,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798140954] [2024-09-20 11:57:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798140954] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 11:57:00,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 11:57:00,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 11:57:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806839850] [2024-09-20 11:57:00,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 11:57:00,487 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 11:57:00,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:57:00,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 11:57:00,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 11:57:00,488 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:00,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:57:00,554 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2024-09-20 11:57:00,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 11:57:00,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2024-09-20 11:57:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:57:00,556 INFO L225 Difference]: With dead ends: 49 [2024-09-20 11:57:00,556 INFO L226 Difference]: Without dead ends: 28 [2024-09-20 11:57:00,556 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-20 11:57:00,557 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 11:57:00,557 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 97 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 11:57:00,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-20 11:57:00,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-20 11:57:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-09-20 11:57:00,569 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2024-09-20 11:57:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:57:00,569 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-09-20 11:57:00,570 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:00,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-09-20 11:57:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-20 11:57:00,572 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:57:00,572 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 11:57:00,572 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 11:57:00,572 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:57:00,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:00,573 INFO L85 PathProgramCache]: Analyzing trace with hash 343340118, now seen corresponding path program 1 times [2024-09-20 11:57:00,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:57:00,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563660661] [2024-09-20 11:57:00,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:57:00,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:57:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:00,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:57:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 11:57:00,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:57:00,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563660661] [2024-09-20 11:57:00,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563660661] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 11:57:00,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 11:57:00,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 11:57:00,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538132523] [2024-09-20 11:57:00,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 11:57:00,617 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 11:57:00,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:57:00,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 11:57:00,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 11:57:00,617 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:57:00,640 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-09-20 11:57:00,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 11:57:00,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 17 [2024-09-20 11:57:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:57:00,643 INFO L225 Difference]: With dead ends: 43 [2024-09-20 11:57:00,643 INFO L226 Difference]: Without dead ends: 28 [2024-09-20 11:57:00,643 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 11:57:00,645 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 11:57:00,646 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 11:57:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-20 11:57:00,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-20 11:57:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-09-20 11:57:00,653 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 17 [2024-09-20 11:57:00,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:57:00,654 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-09-20 11:57:00,654 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:00,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-09-20 11:57:00,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-20 11:57:00,655 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:57:00,656 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 11:57:00,657 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 11:57:00,657 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:57:00,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1256824498, now seen corresponding path program 1 times [2024-09-20 11:57:00,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:57:00,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390832040] [2024-09-20 11:57:00,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:57:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:57:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:00,770 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:57:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 11:57:00,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:57:00,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390832040] [2024-09-20 11:57:00,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390832040] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 11:57:00,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 11:57:00,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-20 11:57:00,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136169756] [2024-09-20 11:57:00,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 11:57:00,774 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 11:57:00,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:57:00,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 11:57:00,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-20 11:57:00,775 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:00,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:57:00,860 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-09-20 11:57:00,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 11:57:00,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 17 [2024-09-20 11:57:00,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:57:00,861 INFO L225 Difference]: With dead ends: 44 [2024-09-20 11:57:00,861 INFO L226 Difference]: Without dead ends: 28 [2024-09-20 11:57:00,861 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-20 11:57:00,862 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 11:57:00,862 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 72 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 11:57:00,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-20 11:57:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-09-20 11:57:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-09-20 11:57:00,867 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 17 [2024-09-20 11:57:00,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:57:00,867 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-09-20 11:57:00,867 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:00,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-09-20 11:57:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-20 11:57:00,868 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:57:00,868 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 11:57:00,868 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 11:57:00,868 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:57:00,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:00,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1081416993, now seen corresponding path program 1 times [2024-09-20 11:57:00,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:57:00,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618690525] [2024-09-20 11:57:00,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:57:00,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:57:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:01,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:57:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 11:57:01,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:57:01,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618690525] [2024-09-20 11:57:01,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618690525] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 11:57:01,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 11:57:01,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-20 11:57:01,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999770723] [2024-09-20 11:57:01,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 11:57:01,046 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 11:57:01,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:57:01,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 11:57:01,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-20 11:57:01,047 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:01,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:57:01,134 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-09-20 11:57:01,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 11:57:01,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2024-09-20 11:57:01,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:57:01,135 INFO L225 Difference]: With dead ends: 34 [2024-09-20 11:57:01,135 INFO L226 Difference]: Without dead ends: 28 [2024-09-20 11:57:01,135 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-20 11:57:01,136 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 11:57:01,136 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 77 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 11:57:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-20 11:57:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-09-20 11:57:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-20 11:57:01,141 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2024-09-20 11:57:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:57:01,141 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-20 11:57:01,141 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:01,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-20 11:57:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-20 11:57:01,142 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:57:01,142 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 11:57:01,142 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 11:57:01,143 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:57:01,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:01,144 INFO L85 PathProgramCache]: Analyzing trace with hash 663506992, now seen corresponding path program 1 times [2024-09-20 11:57:01,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:57:01,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7033009] [2024-09-20 11:57:01,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:57:01,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:57:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:01,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:57:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 11:57:01,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:57:01,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7033009] [2024-09-20 11:57:01,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7033009] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 11:57:01,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 11:57:01,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 11:57:01,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506095500] [2024-09-20 11:57:01,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 11:57:01,209 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 11:57:01,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:57:01,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 11:57:01,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 11:57:01,210 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:57:01,256 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-09-20 11:57:01,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 11:57:01,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 19 [2024-09-20 11:57:01,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:57:01,258 INFO L225 Difference]: With dead ends: 34 [2024-09-20 11:57:01,258 INFO L226 Difference]: Without dead ends: 28 [2024-09-20 11:57:01,259 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-20 11:57:01,260 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 11:57:01,261 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 56 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 11:57:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-20 11:57:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-09-20 11:57:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-09-20 11:57:01,268 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2024-09-20 11:57:01,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:57:01,269 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-09-20 11:57:01,269 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:01,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-09-20 11:57:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-20 11:57:01,271 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:57:01,271 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 11:57:01,271 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 11:57:01,271 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:57:01,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:01,271 INFO L85 PathProgramCache]: Analyzing trace with hash 679086302, now seen corresponding path program 1 times [2024-09-20 11:57:01,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:57:01,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802484586] [2024-09-20 11:57:01,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:57:01,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:57:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:01,373 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:57:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 11:57:01,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:57:01,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802484586] [2024-09-20 11:57:01,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802484586] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 11:57:01,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 11:57:01,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 11:57:01,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839782173] [2024-09-20 11:57:01,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 11:57:01,378 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 11:57:01,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:57:01,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 11:57:01,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-20 11:57:01,380 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:01,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:57:01,399 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-09-20 11:57:01,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 11:57:01,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 20 [2024-09-20 11:57:01,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:57:01,400 INFO L225 Difference]: With dead ends: 28 [2024-09-20 11:57:01,400 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 11:57:01,400 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-20 11:57:01,401 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 11:57:01,402 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 20 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 11:57:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 11:57:01,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 11:57:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 11:57:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 11:57:01,404 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2024-09-20 11:57:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:57:01,405 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 11:57:01,405 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 11:57:01,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:01,405 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 11:57:01,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 11:57:01,407 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 11:57:01,407 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-20 11:57:01,410 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-09-20 11:57:01,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 11:57:01,584 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 11:57:01,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 11:57:01 BoogieIcfgContainer [2024-09-20 11:57:01,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 11:57:01,597 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 11:57:01,597 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 11:57:01,597 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 11:57:01,597 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:56:59" (3/4) ... [2024-09-20 11:57:01,599 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-20 11:57:01,636 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-20 11:57:01,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 11:57:01,638 INFO L158 Benchmark]: Toolchain (without parser) took 2540.41ms. Allocated memory was 172.0MB in the beginning and 224.4MB in the end (delta: 52.4MB). Free memory was 97.8MB in the beginning and 99.5MB in the end (delta: -1.7MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2024-09-20 11:57:01,638 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 11:57:01,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.57ms. Allocated memory is still 172.0MB. Free memory was 97.8MB in the beginning and 140.8MB in the end (delta: -43.0MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-09-20 11:57:01,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.77ms. Allocated memory is still 172.0MB. Free memory was 140.7MB in the beginning and 139.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 11:57:01,639 INFO L158 Benchmark]: Boogie Preprocessor took 46.01ms. Allocated memory is still 172.0MB. Free memory was 139.7MB in the beginning and 137.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 11:57:01,639 INFO L158 Benchmark]: RCFGBuilder took 366.83ms. Allocated memory was 172.0MB in the beginning and 224.4MB in the end (delta: 52.4MB). Free memory was 137.8MB in the beginning and 179.2MB in the end (delta: -41.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-20 11:57:01,640 INFO L158 Benchmark]: TraceAbstraction took 1858.90ms. Allocated memory is still 224.4MB. Free memory was 179.2MB in the beginning and 101.3MB in the end (delta: 77.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-09-20 11:57:01,640 INFO L158 Benchmark]: Witness Printer took 39.15ms. Allocated memory is still 224.4MB. Free memory was 101.3MB in the beginning and 99.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 11:57:01,641 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.15ms. Allocated memory is still 172.0MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.57ms. Allocated memory is still 172.0MB. Free memory was 97.8MB in the beginning and 140.8MB in the end (delta: -43.0MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.77ms. Allocated memory is still 172.0MB. Free memory was 140.7MB in the beginning and 139.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.01ms. Allocated memory is still 172.0MB. Free memory was 139.7MB in the beginning and 137.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 366.83ms. Allocated memory was 172.0MB in the beginning and 224.4MB in the end (delta: 52.4MB). Free memory was 137.8MB in the beginning and 179.2MB in the end (delta: -41.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1858.90ms. Allocated memory is still 224.4MB. Free memory was 179.2MB in the beginning and 101.3MB in the end (delta: 77.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Witness Printer took 39.15ms. Allocated memory is still 224.4MB. Free memory was 101.3MB in the beginning and 99.5MB in the end (delta: 1.9MB). 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: 17]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 434 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 284 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 237 IncrementalHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 150 mSDtfsCounter, 237 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 280 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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 - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-20 11:57:01,665 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