./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label17.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 eca4fa24c7d17d702b457b7d1d0ed6513492942e324299a6e335f63078cc8b55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:57:45,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:57:45,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:57:45,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:57:45,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:57:45,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:57:45,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:57:45,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:57:45,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:57:45,866 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:57:45,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:57:45,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:57:45,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:57:45,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:57:45,866 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:57:45,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:57:45,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:57:45,867 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:57:45,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:57:45,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:57:45,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:57:45,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:57:45,868 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:57:45,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:57:45,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:57:45,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:57:45,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:57:45,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:57:45,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:57:45,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:57:45,868 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> eca4fa24c7d17d702b457b7d1d0ed6513492942e324299a6e335f63078cc8b55 [2025-01-08 23:57:46,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:57:46,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:57:46,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:57:46,106 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:57:46,107 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:57:46,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label17.c [2025-01-08 23:57:47,151 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54d7d66b3/0f06c9359bbb4e30a14d45e461ef1fdb/FLAG07e694450 [2025-01-08 23:57:47,433 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:57:47,438 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label17.c [2025-01-08 23:57:47,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54d7d66b3/0f06c9359bbb4e30a14d45e461ef1fdb/FLAG07e694450 [2025-01-08 23:57:47,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54d7d66b3/0f06c9359bbb4e30a14d45e461ef1fdb [2025-01-08 23:57:47,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:57:47,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:57:47,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:57:47,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:57:47,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:57:47,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:57:47" (1/1) ... [2025-01-08 23:57:47,717 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608424ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:47, skipping insertion in model container [2025-01-08 23:57:47,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:57:47" (1/1) ... [2025-01-08 23:57:47,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:57:47,872 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label17.c[5746,5759] [2025-01-08 23:57:47,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:57:47,965 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:57:47,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label17.c[5746,5759] [2025-01-08 23:57:48,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:57:48,033 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:57:48,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:48 WrapperNode [2025-01-08 23:57:48,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:57:48,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:57:48,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:57:48,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:57:48,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:48" (1/1) ... [2025-01-08 23:57:48,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:48" (1/1) ... [2025-01-08 23:57:48,092 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-01-08 23:57:48,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:57:48,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:57:48,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:57:48,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:57:48,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:48" (1/1) ... [2025-01-08 23:57:48,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:48" (1/1) ... [2025-01-08 23:57:48,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:48" (1/1) ... [2025-01-08 23:57:48,139 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]. [2025-01-08 23:57:48,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:48" (1/1) ... [2025-01-08 23:57:48,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:48" (1/1) ... [2025-01-08 23:57:48,169 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:48" (1/1) ... [2025-01-08 23:57:48,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:48" (1/1) ... [2025-01-08 23:57:48,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:48" (1/1) ... [2025-01-08 23:57:48,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:48" (1/1) ... [2025-01-08 23:57:48,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:48" (1/1) ... [2025-01-08 23:57:48,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:57:48,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:57:48,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:57:48,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:57:48,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:48" (1/1) ... [2025-01-08 23:57:48,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:57:48,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:48,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:57:48,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:57:48,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:57:48,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:57:48,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:57:48,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:57:48,341 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:57:48,343 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:57:49,156 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-01-08 23:57:49,159 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:57:49,168 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:57:49,168 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:57:49,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:57:49 BoogieIcfgContainer [2025-01-08 23:57:49,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:57:49,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:57:49,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:57:49,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:57:49,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:57:47" (1/3) ... [2025-01-08 23:57:49,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2809de1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:57:49, skipping insertion in model container [2025-01-08 23:57:49,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:48" (2/3) ... [2025-01-08 23:57:49,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2809de1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:57:49, skipping insertion in model container [2025-01-08 23:57:49,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:57:49" (3/3) ... [2025-01-08 23:57:49,175 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label17.c [2025-01-08 23:57:49,184 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:57:49,185 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label17.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:57:49,218 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:57:49,225 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=LoopHeads, 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;@360bd2f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:57:49,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:57:49,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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) [2025-01-08 23:57:49,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-08 23:57:49,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:49,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:49,233 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:49,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash 598103698, now seen corresponding path program 1 times [2025-01-08 23:57:49,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:49,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364932332] [2025-01-08 23:57:49,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:49,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:49,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-08 23:57:49,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-08 23:57:49,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:49,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:57:49,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:49,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364932332] [2025-01-08 23:57:49,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364932332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:49,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:49,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:49,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116625842] [2025-01-08 23:57:49,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:49,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:57:49,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:49,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:57:49,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:57:49,647 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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) Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 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) [2025-01-08 23:57:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:50,880 INFO L93 Difference]: Finished difference Result 852 states and 1556 transitions. [2025-01-08 23:57:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:57:50,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 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) Word has length 56 [2025-01-08 23:57:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:50,890 INFO L225 Difference]: With dead ends: 852 [2025-01-08 23:57:50,890 INFO L226 Difference]: Without dead ends: 538 [2025-01-08 23:57:50,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:57:50,894 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 495 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:50,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 192 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-08 23:57:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-01-08 23:57:50,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-01-08 23:57:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.4487895716945995) internal successors, (778), 537 states have internal predecessors, (778), 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) [2025-01-08 23:57:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2025-01-08 23:57:50,936 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 56 [2025-01-08 23:57:50,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:50,937 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2025-01-08 23:57:50,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 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) [2025-01-08 23:57:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2025-01-08 23:57:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-08 23:57:50,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:50,939 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:50,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:57:50,940 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:50,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1990175487, now seen corresponding path program 1 times [2025-01-08 23:57:50,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:50,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784434069] [2025-01-08 23:57:50,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:50,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:50,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-08 23:57:50,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-08 23:57:50,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:50,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:57:51,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:51,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784434069] [2025-01-08 23:57:51,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784434069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:51,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:51,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:57:51,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592693486] [2025-01-08 23:57:51,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:51,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:51,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:51,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:51,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:51,059 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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) [2025-01-08 23:57:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:51,649 INFO L93 Difference]: Finished difference Result 1074 states and 1656 transitions. [2025-01-08 23:57:51,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:51,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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) Word has length 122 [2025-01-08 23:57:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:51,652 INFO L225 Difference]: With dead ends: 1074 [2025-01-08 23:57:51,652 INFO L226 Difference]: Without dead ends: 716 [2025-01-08 23:57:51,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:51,653 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:51,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:57:51,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-08 23:57:51,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-01-08 23:57:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.353846153846154) internal successors, (968), 715 states have internal predecessors, (968), 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) [2025-01-08 23:57:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 968 transitions. [2025-01-08 23:57:51,692 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 968 transitions. Word has length 122 [2025-01-08 23:57:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:51,692 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 968 transitions. [2025-01-08 23:57:51,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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) [2025-01-08 23:57:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 968 transitions. [2025-01-08 23:57:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-08 23:57:51,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:51,695 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-01-08 23:57:51,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:57:51,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:51,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2082822434, now seen corresponding path program 1 times [2025-01-08 23:57:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:51,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794404519] [2025-01-08 23:57:51,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:51,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:51,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-08 23:57:51,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-08 23:57:51,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:51,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:51,886 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:57:51,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:51,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794404519] [2025-01-08 23:57:51,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794404519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:51,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:51,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:51,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909614832] [2025-01-08 23:57:51,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:51,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:57:51,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:51,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:57:51,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:57:51,888 INFO L87 Difference]: Start difference. First operand 716 states and 968 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 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) [2025-01-08 23:57:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:52,490 INFO L93 Difference]: Finished difference Result 1637 states and 2268 transitions. [2025-01-08 23:57:52,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:57:52,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 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) Word has length 136 [2025-01-08 23:57:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:52,498 INFO L225 Difference]: With dead ends: 1637 [2025-01-08 23:57:52,498 INFO L226 Difference]: Without dead ends: 1072 [2025-01-08 23:57:52,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:57:52,501 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 101 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:52,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 114 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:57:52,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-01-08 23:57:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 894. [2025-01-08 23:57:52,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.1724524076147815) internal successors, (1047), 893 states have internal predecessors, (1047), 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) [2025-01-08 23:57:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1047 transitions. [2025-01-08 23:57:52,531 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1047 transitions. Word has length 136 [2025-01-08 23:57:52,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:52,531 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1047 transitions. [2025-01-08 23:57:52,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 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) [2025-01-08 23:57:52,532 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1047 transitions. [2025-01-08 23:57:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-01-08 23:57:52,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:52,547 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:52,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:57:52,547 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:52,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:52,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2110261143, now seen corresponding path program 1 times [2025-01-08 23:57:52,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:52,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074630395] [2025-01-08 23:57:52,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:52,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:52,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-08 23:57:52,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-08 23:57:52,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:52,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:57:52,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:52,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074630395] [2025-01-08 23:57:52,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074630395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:52,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:52,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:52,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125499476] [2025-01-08 23:57:52,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:52,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:52,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:52,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:52,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:52,951 INFO L87 Difference]: Start difference. First operand 894 states and 1047 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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) [2025-01-08 23:57:53,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:53,378 INFO L93 Difference]: Finished difference Result 2142 states and 2597 transitions. [2025-01-08 23:57:53,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:53,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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) Word has length 336 [2025-01-08 23:57:53,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:53,382 INFO L225 Difference]: With dead ends: 2142 [2025-01-08 23:57:53,382 INFO L226 Difference]: Without dead ends: 1428 [2025-01-08 23:57:53,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:53,383 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:53,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 77 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:57:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-01-08 23:57:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1250. [2025-01-08 23:57:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.154523618895116) internal successors, (1442), 1249 states have internal predecessors, (1442), 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) [2025-01-08 23:57:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1442 transitions. [2025-01-08 23:57:53,400 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1442 transitions. Word has length 336 [2025-01-08 23:57:53,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:53,400 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1442 transitions. [2025-01-08 23:57:53,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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) [2025-01-08 23:57:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1442 transitions. [2025-01-08 23:57:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-01-08 23:57:53,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:53,403 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:53,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:57:53,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:53,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:53,404 INFO L85 PathProgramCache]: Analyzing trace with hash 173555520, now seen corresponding path program 1 times [2025-01-08 23:57:53,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:53,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470956375] [2025-01-08 23:57:53,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:53,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:53,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-01-08 23:57:53,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-01-08 23:57:53,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:53,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-01-08 23:57:53,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:53,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470956375] [2025-01-08 23:57:53,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470956375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:53,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:53,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:53,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458351105] [2025-01-08 23:57:53,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:53,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:57:53,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:53,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:57:53,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:57:53,700 INFO L87 Difference]: Start difference. First operand 1250 states and 1442 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 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) [2025-01-08 23:57:54,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:54,194 INFO L93 Difference]: Finished difference Result 2527 states and 2948 transitions. [2025-01-08 23:57:54,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:57:54,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 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) Word has length 347 [2025-01-08 23:57:54,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:54,199 INFO L225 Difference]: With dead ends: 2527 [2025-01-08 23:57:54,199 INFO L226 Difference]: Without dead ends: 1428 [2025-01-08 23:57:54,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:57:54,203 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:54,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 17 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:57:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-01-08 23:57:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1250. [2025-01-08 23:57:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.1056845476381105) internal successors, (1381), 1249 states have internal predecessors, (1381), 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) [2025-01-08 23:57:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1381 transitions. [2025-01-08 23:57:54,222 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1381 transitions. Word has length 347 [2025-01-08 23:57:54,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:54,223 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1381 transitions. [2025-01-08 23:57:54,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 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) [2025-01-08 23:57:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1381 transitions. [2025-01-08 23:57:54,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-01-08 23:57:54,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:54,227 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:57:54,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:57:54,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:54,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:54,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1000341549, now seen corresponding path program 1 times [2025-01-08 23:57:54,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:54,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555410125] [2025-01-08 23:57:54,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:54,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:54,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-01-08 23:57:54,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-01-08 23:57:54,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:54,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 326 proven. 23 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-08 23:57:54,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:54,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555410125] [2025-01-08 23:57:54,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555410125] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:54,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186875281] [2025-01-08 23:57:54,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:54,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:54,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:54,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:57:54,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:57:54,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-01-08 23:57:54,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-01-08 23:57:54,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:54,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:54,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:57:54,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:57:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-08 23:57:54,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:57:54,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186875281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:54,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:57:54,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:57:54,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708922827] [2025-01-08 23:57:54,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:54,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:54,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:54,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:54,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:57:54,823 INFO L87 Difference]: Start difference. First operand 1250 states and 1381 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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) [2025-01-08 23:57:55,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:55,257 INFO L93 Difference]: Finished difference Result 3032 states and 3402 transitions. [2025-01-08 23:57:55,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:55,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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) Word has length 360 [2025-01-08 23:57:55,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:55,263 INFO L225 Difference]: With dead ends: 3032 [2025-01-08 23:57:55,263 INFO L226 Difference]: Without dead ends: 1962 [2025-01-08 23:57:55,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:57:55,265 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 125 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:55,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 247 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:57:55,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-01-08 23:57:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2025-01-08 23:57:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.0964666292765002) internal successors, (1955), 1783 states have internal predecessors, (1955), 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) [2025-01-08 23:57:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1955 transitions. [2025-01-08 23:57:55,286 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 1955 transitions. Word has length 360 [2025-01-08 23:57:55,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:55,286 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 1955 transitions. [2025-01-08 23:57:55,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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) [2025-01-08 23:57:55,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 1955 transitions. [2025-01-08 23:57:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-08 23:57:55,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:55,291 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2025-01-08 23:57:55,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:57:55,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:55,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:55,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash 455609068, now seen corresponding path program 1 times [2025-01-08 23:57:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:55,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042022073] [2025-01-08 23:57:55,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:55,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-08 23:57:55,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-08 23:57:55,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:55,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 591 proven. 23 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2025-01-08 23:57:55,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:55,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042022073] [2025-01-08 23:57:55,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042022073] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:55,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914221894] [2025-01-08 23:57:55,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:55,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:55,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:55,940 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:57:55,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:57:55,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-08 23:57:56,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-08 23:57:56,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:56,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:56,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:57:56,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:57:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2025-01-08 23:57:56,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:57:56,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914221894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:56,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:57:56,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:57:56,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660793914] [2025-01-08 23:57:56,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:56,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:56,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:56,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:56,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:57:56,167 INFO L87 Difference]: Start difference. First operand 1784 states and 1955 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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) [2025-01-08 23:57:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:56,614 INFO L93 Difference]: Finished difference Result 4278 states and 4742 transitions. [2025-01-08 23:57:56,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:56,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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) Word has length 494 [2025-01-08 23:57:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:56,622 INFO L225 Difference]: With dead ends: 4278 [2025-01-08 23:57:56,623 INFO L226 Difference]: Without dead ends: 2674 [2025-01-08 23:57:56,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:57:56,625 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 128 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:56,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 62 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:57:56,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2025-01-08 23:57:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2140. [2025-01-08 23:57:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.1079943899018232) internal successors, (2370), 2139 states have internal predecessors, (2370), 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) [2025-01-08 23:57:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2370 transitions. [2025-01-08 23:57:56,657 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2370 transitions. Word has length 494 [2025-01-08 23:57:56,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:56,657 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2370 transitions. [2025-01-08 23:57:56,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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) [2025-01-08 23:57:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2370 transitions. [2025-01-08 23:57:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2025-01-08 23:57:56,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:56,663 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:56,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:57:56,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:56,868 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:56,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:56,869 INFO L85 PathProgramCache]: Analyzing trace with hash 405014941, now seen corresponding path program 1 times [2025-01-08 23:57:56,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:56,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102906573] [2025-01-08 23:57:56,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:56,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:56,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 564 statements into 1 equivalence classes. [2025-01-08 23:57:56,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 564 of 564 statements. [2025-01-08 23:57:56,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:56,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 636 proven. 23 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-01-08 23:57:57,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:57,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102906573] [2025-01-08 23:57:57,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102906573] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:57,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791523517] [2025-01-08 23:57:57,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:57,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:57,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:57,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:57:57,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 23:57:57,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 564 statements into 1 equivalence classes. [2025-01-08 23:57:57,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 564 of 564 statements. [2025-01-08 23:57:57,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:57,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:57,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:57:57,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:57:57,540 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-01-08 23:57:57,541 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:57:57,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791523517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:57,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:57:57,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:57:57,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322550129] [2025-01-08 23:57:57,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:57,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:57,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:57,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:57,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:57:57,542 INFO L87 Difference]: Start difference. First operand 2140 states and 2370 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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) [2025-01-08 23:57:57,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:57,945 INFO L93 Difference]: Finished difference Result 4988 states and 5591 transitions. [2025-01-08 23:57:57,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:57,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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) Word has length 564 [2025-01-08 23:57:57,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:57,946 INFO L225 Difference]: With dead ends: 4988 [2025-01-08 23:57:57,946 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:57:57,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:57:57,950 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:57,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 231 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:57:57,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:57:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:57:57,951 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) [2025-01-08 23:57:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:57:57,951 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 564 [2025-01-08 23:57:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:57,951 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:57:57,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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) [2025-01-08 23:57:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:57:57,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:57:57,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:57:57,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 23:57:58,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:58,157 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:58,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:57:58,291 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:57:58,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:57:58 BoogieIcfgContainer [2025-01-08 23:57:58,301 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:57:58,301 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:57:58,301 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:57:58,302 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:57:58,302 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:57:49" (3/4) ... [2025-01-08 23:57:58,303 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:57:58,321 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:57:58,321 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:57:58,322 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:57:58,323 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:57:58,427 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:57:58,428 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:57:58,428 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:57:58,429 INFO L158 Benchmark]: Toolchain (without parser) took 10716.89ms. Allocated memory was 201.3MB in the beginning and 310.4MB in the end (delta: 109.1MB). Free memory was 156.9MB in the beginning and 160.1MB in the end (delta: -3.2MB). Peak memory consumption was 106.8MB. Max. memory is 16.1GB. [2025-01-08 23:57:58,429 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 218.1MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:57:58,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.16ms. Allocated memory is still 201.3MB. Free memory was 156.9MB in the beginning and 124.8MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-08 23:57:58,430 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.12ms. Allocated memory is still 201.3MB. Free memory was 124.8MB in the beginning and 115.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:57:58,430 INFO L158 Benchmark]: Boogie Preprocessor took 118.46ms. Allocated memory is still 201.3MB. Free memory was 115.4MB in the beginning and 103.0MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:57:58,430 INFO L158 Benchmark]: RCFGBuilder took 956.45ms. Allocated memory is still 201.3MB. Free memory was 103.0MB in the beginning and 88.4MB in the end (delta: 14.6MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2025-01-08 23:57:58,431 INFO L158 Benchmark]: TraceAbstraction took 9131.49ms. Allocated memory was 201.3MB in the beginning and 310.4MB in the end (delta: 109.1MB). Free memory was 87.5MB in the beginning and 173.3MB in the end (delta: -85.9MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2025-01-08 23:57:58,431 INFO L158 Benchmark]: Witness Printer took 126.71ms. Allocated memory is still 310.4MB. Free memory was 173.3MB in the beginning and 160.1MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:57:58,432 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.12ms. Allocated memory is still 218.1MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.16ms. Allocated memory is still 201.3MB. Free memory was 156.9MB in the beginning and 124.8MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.12ms. Allocated memory is still 201.3MB. Free memory was 124.8MB in the beginning and 115.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.46ms. Allocated memory is still 201.3MB. Free memory was 115.4MB in the beginning and 103.0MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 956.45ms. Allocated memory is still 201.3MB. Free memory was 103.0MB in the beginning and 88.4MB in the end (delta: 14.6MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9131.49ms. Allocated memory was 201.3MB in the beginning and 310.4MB in the end (delta: 109.1MB). Free memory was 87.5MB in the beginning and 173.3MB in the end (delta: -85.9MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Witness Printer took 126.71ms. Allocated memory is still 310.4MB. Free memory was 173.3MB in the beginning and 160.1MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. 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: 182]: 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 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1351 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1351 mSDsluCounter, 997 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 828 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4937 IncrementalHoareTripleChecker+Invalid, 5765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 828 mSolverCounterUnsat, 940 mSDtfsCounter, 4937 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1442 GetRequests, 1421 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2140occurred in iteration=7, InterpolantAutomatonStates: 27, 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, 8 MinimizatonAttempts, 1246 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 3833 NumberOfCodeBlocks, 3833 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3822 ConstructedInterpolants, 0 QuantifiedInterpolants, 14418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1798 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 5053/5122 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((((((a15 <= 8) && (10 <= a21)) || ((a24 == 1) && (7 == a21))) || ((a12 <= 80) && (a15 <= 8))) || ((a15 <= 8) && (a21 <= 6))) || ((a24 == 1) && (5 != a15))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:57:58,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE