./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label13.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/Problem01_label13.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 8b3e81a6b8b0761a41c3ab08eaf65813a0a29373f8751b3e6d15ff26531d677e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:52:29,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:52:29,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:52:29,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:52:29,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:52:29,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:52:29,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:52:29,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:52:29,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:52:29,088 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:52:29,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:52:29,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:52:29,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:52:29,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:52:29,089 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:52:29,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:52:29,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:52:29,090 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:52:29,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:52:29,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:52:29,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:52:29,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:52:29,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:52:29,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:52:29,091 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:52:29,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:52:29,091 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:52:29,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:52:29,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:52:29,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:52:29,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:52:29,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:52:29,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:52:29,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:52:29,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:52:29,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:52:29,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:52:29,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:52:29,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:52:29,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:52:29,093 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:52:29,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:52:29,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:52:29,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:52:29,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:52:29,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:52:29,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:52:29,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:52:29,093 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 -> 8b3e81a6b8b0761a41c3ab08eaf65813a0a29373f8751b3e6d15ff26531d677e [2025-01-08 22:52:29,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:52:29,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:52:29,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:52:29,318 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:52:29,318 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:52:29,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label13.c [2025-01-08 22:52:30,430 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/edd4ec233/82136cfe853748fb9ec8eb5ca5e40b8f/FLAG9e4330a24 [2025-01-08 22:52:30,746 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:52:30,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label13.c [2025-01-08 22:52:30,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/edd4ec233/82136cfe853748fb9ec8eb5ca5e40b8f/FLAG9e4330a24 [2025-01-08 22:52:30,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/edd4ec233/82136cfe853748fb9ec8eb5ca5e40b8f [2025-01-08 22:52:30,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:52:30,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:52:30,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:52:30,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:52:30,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:52:30,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:52:30" (1/1) ... [2025-01-08 22:52:30,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f773c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:30, skipping insertion in model container [2025-01-08 22:52:30,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:52:30" (1/1) ... [2025-01-08 22:52:30,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:52:31,039 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/Problem01_label13.c[20841,20854] [2025-01-08 22:52:31,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:52:31,058 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:52:31,107 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/Problem01_label13.c[20841,20854] [2025-01-08 22:52:31,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:52:31,125 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:52:31,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:31 WrapperNode [2025-01-08 22:52:31,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:52:31,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:52:31,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:52:31,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:52:31,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:31" (1/1) ... [2025-01-08 22:52:31,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:31" (1/1) ... [2025-01-08 22:52:31,178 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-01-08 22:52:31,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:52:31,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:52:31,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:52:31,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:52:31,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:31" (1/1) ... [2025-01-08 22:52:31,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:31" (1/1) ... [2025-01-08 22:52:31,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:31" (1/1) ... [2025-01-08 22:52:31,213 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 22:52:31,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:31" (1/1) ... [2025-01-08 22:52:31,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:31" (1/1) ... [2025-01-08 22:52:31,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:31" (1/1) ... [2025-01-08 22:52:31,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:31" (1/1) ... [2025-01-08 22:52:31,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:31" (1/1) ... [2025-01-08 22:52:31,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:31" (1/1) ... [2025-01-08 22:52:31,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:31" (1/1) ... [2025-01-08 22:52:31,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:52:31,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:52:31,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:52:31,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:52:31,247 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:31" (1/1) ... [2025-01-08 22:52:31,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:52:31,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:52:31,279 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 22:52:31,283 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 22:52:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:52:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:52:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:52:31,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:52:31,367 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:52:31,369 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:52:32,101 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-01-08 22:52:32,101 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:52:32,118 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:52:32,121 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:52:32,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:32 BoogieIcfgContainer [2025-01-08 22:52:32,122 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:52:32,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:52:32,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:52:32,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:52:32,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:52:30" (1/3) ... [2025-01-08 22:52:32,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6e1da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:52:32, skipping insertion in model container [2025-01-08 22:52:32,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:31" (2/3) ... [2025-01-08 22:52:32,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6e1da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:52:32, skipping insertion in model container [2025-01-08 22:52:32,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:32" (3/3) ... [2025-01-08 22:52:32,131 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label13.c [2025-01-08 22:52:32,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:52:32,153 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label13.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:52:32,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:52:32,231 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;@25080724, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:52:32,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:52:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 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 22:52:32,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-08 22:52:32,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:32,241 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:32,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:32,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:32,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1232808537, now seen corresponding path program 1 times [2025-01-08 22:52:32,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:32,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554535916] [2025-01-08 22:52:32,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:32,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:32,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-08 22:52:32,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-08 22:52:32,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:32,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:32,932 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 22:52:32,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:32,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554535916] [2025-01-08 22:52:32,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554535916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:32,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:32,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:52:32,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348822998] [2025-01-08 22:52:32,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:32,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:52:32,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:32,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:52:32,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:52:32,959 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 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 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 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 22:52:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:33,933 INFO L93 Difference]: Finished difference Result 662 states and 1174 transitions. [2025-01-08 22:52:33,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:52:33,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 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 123 [2025-01-08 22:52:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:33,941 INFO L225 Difference]: With dead ends: 662 [2025-01-08 22:52:33,941 INFO L226 Difference]: Without dead ends: 397 [2025-01-08 22:52:33,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:52:33,945 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 352 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:33,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 59 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 22:52:33,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-01-08 22:52:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-01-08 22:52:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.351010101010101) internal successors, (535), 396 states have internal predecessors, (535), 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 22:52:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 535 transitions. [2025-01-08 22:52:33,983 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 535 transitions. Word has length 123 [2025-01-08 22:52:33,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:33,984 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 535 transitions. [2025-01-08 22:52:33,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 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 22:52:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 535 transitions. [2025-01-08 22:52:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-08 22:52:33,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:33,991 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:33,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:52:33,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:33,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:33,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1887826766, now seen corresponding path program 1 times [2025-01-08 22:52:33,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:33,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736697094] [2025-01-08 22:52:33,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:33,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:34,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-08 22:52:34,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-08 22:52:34,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:34,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:52:34,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:34,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736697094] [2025-01-08 22:52:34,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736697094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:34,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:34,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:34,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799844911] [2025-01-08 22:52:34,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:34,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:52:34,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:34,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:52:34,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:52:34,173 INFO L87 Difference]: Start difference. First operand 397 states and 535 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 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 22:52:34,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:34,662 INFO L93 Difference]: Finished difference Result 1054 states and 1523 transitions. [2025-01-08 22:52:34,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:52:34,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 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 140 [2025-01-08 22:52:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:34,665 INFO L225 Difference]: With dead ends: 1054 [2025-01-08 22:52:34,665 INFO L226 Difference]: Without dead ends: 790 [2025-01-08 22:52:34,670 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 22:52:34,670 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 274 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:34,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 35 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:52:34,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-01-08 22:52:34,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2025-01-08 22:52:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.3206686930091185) internal successors, (869), 658 states have internal predecessors, (869), 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 22:52:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 869 transitions. [2025-01-08 22:52:34,701 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 869 transitions. Word has length 140 [2025-01-08 22:52:34,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:34,701 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 869 transitions. [2025-01-08 22:52:34,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 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 22:52:34,702 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 869 transitions. [2025-01-08 22:52:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-08 22:52:34,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:34,704 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:34,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:52:34,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:34,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:34,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1646075160, now seen corresponding path program 1 times [2025-01-08 22:52:34,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:34,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821999248] [2025-01-08 22:52:34,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:34,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:34,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-08 22:52:34,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-08 22:52:34,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:34,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:52:34,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:34,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821999248] [2025-01-08 22:52:34,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821999248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:34,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:34,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:52:34,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837914174] [2025-01-08 22:52:34,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:34,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:34,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:34,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:34,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:34,915 INFO L87 Difference]: Start difference. First operand 659 states and 869 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 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 22:52:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:35,245 INFO L93 Difference]: Finished difference Result 1709 states and 2328 transitions. [2025-01-08 22:52:35,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:35,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 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 143 [2025-01-08 22:52:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:35,249 INFO L225 Difference]: With dead ends: 1709 [2025-01-08 22:52:35,249 INFO L226 Difference]: Without dead ends: 1183 [2025-01-08 22:52:35,250 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 22:52:35,250 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:35,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 72 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:35,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-01-08 22:52:35,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1052. [2025-01-08 22:52:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.247383444338725) internal successors, (1311), 1051 states have internal predecessors, (1311), 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 22:52:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1311 transitions. [2025-01-08 22:52:35,265 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1311 transitions. Word has length 143 [2025-01-08 22:52:35,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:35,266 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1311 transitions. [2025-01-08 22:52:35,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 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 22:52:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1311 transitions. [2025-01-08 22:52:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-08 22:52:35,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:52:35,268 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:52:35,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:52:35,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:52:35,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:52:35,269 INFO L85 PathProgramCache]: Analyzing trace with hash -54125237, now seen corresponding path program 1 times [2025-01-08 22:52:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:52:35,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911029981] [2025-01-08 22:52:35,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:52:35,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:52:35,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-08 22:52:35,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-08 22:52:35,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:52:35,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:52:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:52:35,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:52:35,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911029981] [2025-01-08 22:52:35,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911029981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:52:35,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:52:35,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:52:35,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177131589] [2025-01-08 22:52:35,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:52:35,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:52:35,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:52:35,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:52:35,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:52:35,373 INFO L87 Difference]: Start difference. First operand 1052 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 22:52:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:52:35,689 INFO L93 Difference]: Finished difference Result 2493 states and 3126 transitions. [2025-01-08 22:52:35,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:52:35,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 149 [2025-01-08 22:52:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:52:35,689 INFO L225 Difference]: With dead ends: 2493 [2025-01-08 22:52:35,689 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:52:35,691 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 22:52:35,692 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:52:35,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 22 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:52:35,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:52:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:52:35,692 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 22:52:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:52:35,693 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 149 [2025-01-08 22:52:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:52:35,693 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:52:35,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 22:52:35,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:52:35,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:52:35,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:52:35,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:52:35,697 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-08 22:52:35,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:52:35,729 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:52:35,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:52:35 BoogieIcfgContainer [2025-01-08 22:52:35,738 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:52:35,738 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:52:35,738 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:52:35,738 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:52:35,739 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:32" (3/4) ... [2025-01-08 22:52:35,740 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:52:35,749 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 22:52:35,750 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:52:35,750 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:52:35,751 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:52:35,855 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:52:35,856 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:52:35,856 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:52:35,860 INFO L158 Benchmark]: Toolchain (without parser) took 5065.23ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 128.2MB in the beginning and 98.5MB in the end (delta: 29.7MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2025-01-08 22:52:35,860 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:52:35,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.78ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 101.6MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 22:52:35,860 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.25ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 96.0MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:52:35,860 INFO L158 Benchmark]: Boogie Preprocessor took 66.29ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 91.3MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:52:35,861 INFO L158 Benchmark]: RCFGBuilder took 876.10ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 92.1MB in the end (delta: -747.4kB). Peak memory consumption was 67.8MB. Max. memory is 16.1GB. [2025-01-08 22:52:35,861 INFO L158 Benchmark]: TraceAbstraction took 3614.18ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 92.1MB in the beginning and 108.9MB in the end (delta: -16.8MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2025-01-08 22:52:35,861 INFO L158 Benchmark]: Witness Printer took 117.90ms. Allocated memory is still 201.3MB. Free memory was 108.9MB in the beginning and 98.5MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:52:35,862 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 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.78ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 101.6MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.25ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 96.0MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.29ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 91.3MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 876.10ms. Allocated memory is still 167.8MB. Free memory was 91.3MB in the beginning and 92.1MB in the end (delta: -747.4kB). Peak memory consumption was 67.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3614.18ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 92.1MB in the beginning and 108.9MB in the end (delta: -16.8MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Witness Printer took 117.90ms. Allocated memory is still 201.3MB. Free memory was 108.9MB in the beginning and 98.5MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. 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: 555]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 886 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 886 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 569 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2036 IncrementalHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 569 mSolverCounterUnsat, 147 mSDtfsCounter, 2036 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1052occurred in iteration=3, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 262 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 555 NumberOfCodeBlocks, 555 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 551 ConstructedInterpolants, 0 QuantifiedInterpolants, 2959 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 84/84 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: 593]: Loop Invariant Derived loop invariant: (((a16 < 6) || ((a7 != 1) && (a17 == 1))) || (14 != a8)) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:52:35,882 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